blob_id
stringlengths 40
40
| directory_id
stringlengths 40
40
| path
stringlengths 4
201
| content_id
stringlengths 40
40
| detected_licenses
sequencelengths 0
85
| license_type
stringclasses 2
values | repo_name
stringlengths 7
100
| snapshot_id
stringlengths 40
40
| revision_id
stringlengths 40
40
| branch_name
stringclasses 260
values | visit_date
timestamp[us] | revision_date
timestamp[us] | committer_date
timestamp[us] | github_id
int64 11.4k
681M
⌀ | star_events_count
int64 0
209k
| fork_events_count
int64 0
110k
| gha_license_id
stringclasses 17
values | gha_event_created_at
timestamp[us] | gha_created_at
timestamp[us] | gha_language
stringclasses 80
values | src_encoding
stringclasses 28
values | language
stringclasses 1
value | is_vendor
bool 1
class | is_generated
bool 2
classes | length_bytes
int64 8
9.86M
| extension
stringclasses 52
values | content
stringlengths 8
9.86M
| authors
sequencelengths 1
1
| author
stringlengths 0
119
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0e90d0f6a8ce90f6a76e2bec6ad486a9a4a8046a | fe5e4748939432af1d691f9d5837206fbf6c6c2f | /C++/bfs_4.cpp | ab358cfa89455f1c25507562d4c0817d26161b16 | [] | no_license | soadkhan/My-Code | e0ebe0898d68df983e8c41e56633780d6ac22c39 | 72fc258cdbf08d86f20a565afe371713e8e8bc39 | refs/heads/master | 2021-01-23T03:27:34.181019 | 2017-03-24T14:42:15 | 2017-03-24T14:42:15 | 86,077,758 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,863 | cpp | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ulld;
typedef long long int lld;
typedef long int ld;
class node{
public:
ld x;
ld y;
node(int a=0, int b=0){
x = a;
y = b;
}
bool operator == (node a){
if(x==a.x&&y==a.y) return true;
else return false;
}
};
ld mat[1010][1010];
ld dx[] = {1,0,-1,0};
ld dy[] = {0,1,0,-1};
ld bfs(node start,node des,ld r , ld c){
queue<node>list_node;
list_node.push(start);
while(list_node.empty()!=true){
node hand = list_node.front();
list_node.pop();
for(ld i = 0; i < 4 ; i++){
if(hand.x+dx[i]>=0&&hand.x+dx[i]<r&&hand.y+dy[i]>=0&&hand.y+dy[i]<c)
if(mat[hand.x+dx[i]][hand.y+dy[i]]==0)
{
node next(hand.x+dx[i],hand.y+dy[i]);
if(!(next==start))list_node.push(next);
if(!(next==start))mat[hand.x+dx[i]][hand.y+dy[i]] = mat[hand.x][hand.y] + 1;
if(des == next ) return mat[des.x][des.y];
}
}
}
}
int main(void) {
//freopen("uva.txt","rt",stdin);
//freopen("uva_out.txt","wt",stdout);
ld r,c;
while(cin>>r>>c){
if(r==0&&c==0) break;
for(ld i = 0;i<r;i++)
for(ld j=0;j<c;j++)
mat[i][j] = 0;
ld cases;
cin>>cases;
while(cases--){
ld row,col,num;
cin>>row>>num;
while(num--){
cin>>col;
mat[row][col] = -1;
}
}
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
node start(x1,y1);
node des(x2,y2);
cout<<bfs(start,des,r,c)<<endl;
}
return 0;
}
| [
"[email protected]"
] | |
41b472878bb0ffe02474a43f939a0f9d14736c31 | b62835c35ededb2d1b4cb0a83db1945f06099479 | /threads/threads/sample.cpp | ffe4901e335165c8ef0d0cd3c87d6567c05e3c12 | [] | no_license | kylerichey/exampleCodeCS360 | b03a584492f8a480af612cf23c85991d82ad5836 | b88805047bacdffb2e8982db1da919ea68bac5b3 | refs/heads/master | 2021-01-24T17:50:44.485337 | 2016-03-28T21:08:15 | 2016-03-28T21:08:15 | 53,171,449 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 956 | cpp | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <unistd.h>
void *functionC(void *ptr);
int counter = 0;
main()
{
int rc1, rc2;
pthread_t thread1, thread2;
/* Create independent threads each of which will execute functionC */
if( (rc1=pthread_create( &thread1, NULL, &functionC, NULL)) )
{
printf("Thread creation failed: %d\n", rc1);
}
if( (rc2=pthread_create( &thread2, NULL, &functionC, NULL)) )
{
printf("Thread creation failed: %d\n", rc2);
}
/* Wait till threads are complete before main continues. Unless we */
/* wait we run the risk of executing an exit which will terminate */
/* the process and all threads before the threads have completed. */
pthread_join( thread1, NULL);
pthread_join( thread2, NULL);
exit(0);
}
void *functionC(void *ptr)
{
int tmp = counter;
sleep(1);
tmp++;
counter = tmp;
printf("Counter value: %d\n",counter);
}
| [
"[email protected]"
] | |
b5b70ea6679d5af7de9a77fdcf3cb0fb7a07ef78 | 058355106fcf57b746afc5e9979281477c8bd34c | /.history/138.copy-list-with-random-pointer_20200907102809.cpp | fbf65e27a52076910a2e4344160d812b3ce7149b | [] | no_license | Subzero-10/leetcode | ff24f133f984b86eac686ed9b9cccbefb15c9dd8 | 701ec3dd4020970ecb55734de0355c8666849578 | refs/heads/master | 2022-12-24T19:03:16.482923 | 2020-10-11T09:25:29 | 2020-10-11T09:25:29 | 291,388,415 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 978 | cpp | /*
* @lc app=leetcode id=138 lang=cpp
*
* [138] Copy List with Random Pointer
*/
// @lc code=start
/*
// Definition for a Node.
class Node {
public:
int val;
Node* next;
Node* random;
Node(int _val) {
val = _val;
next = NULL;
random = NULL;
}
};
*/
class Solution {
public:
Node* copyRandomList(Node* head) {
Node* root = head;
while (head)
{
Node* newHead = new Node(head->val);
newHead->next = head->next;
head->next = newHead;
head = newHead->next;
}
Node* head2 = root;
root = root->next;
while (head2)
{
Node* newHead = head2->next;
newHead->random = head2->random->next;
head2->next = newHead->next;
newHead->next = newHead->next->next;
head2 = head2->next;
printf("?");
}
return root;
}
};
// @lc code=end
| [
"[email protected]"
] | |
39f254028246b96f1f7f1493dd100052b2867c5f | 8de91a1aebb00600a98a69b7b8c783cb6a020720 | /cp/MaxFlow.cpp | 05ef8dbcd14733a3b3738e3a9485ab2cd295f79c | [] | no_license | RenatoBrittoAraujo/Competitive-Programming | 2148d5fc4b0ac4b8fdbadc8de2916b31a549e183 | de641f129a1ce27deffb7bf7c1635d702d05bf3e | refs/heads/master | 2020-05-22T21:17:41.420014 | 2019-05-17T00:39:20 | 2019-05-17T00:39:20 | 186,523,234 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,340 | cpp | #include <bits/stdc++.h>
using namespace std;
#define MAX_V 1500 //more than this and maxflow takes too long
#define inf 1000000
using vi = vector<int>;
int G[MAX_V][MAX_V];
vi p;
int mf,f,s,t;
void augment(int v,int me){
if(v==s){
f=me;
return;
}else if(p[v]!=-1){
augment(p[v],min(me,G[p[v]][v]));
G[p[v]][v]-=f;
G[v][p[v]]+=f;
}
}
int main(){
//SET 't' (sink), 's' (source), and the 'G' graph to run max flow
//print graph
for(int i=0;i<n+2;i++){
for(int j=0;j<n+2;j++){
printf(" %5d",G[i][j]);
}printf("\n");
}
//MAX FLOW BFS LOOP
mf=0;
while(1){
f=0;
vi dist(MAX_V, inf);
dist[s]=0;
queue<int> q;
q.push(s);
p.assign(MAX_V,-1);
while(!q.empty()){
int u = q.front();
q.pop();
if(t==u)break;
for(int v=0;v<MAX_V;v++)
if(G[u][v]>0&&dist[v]==inf)
dist[v]=dist[u]+1,q.push(v),p[v]=u;
}
augment(t,inf);
if(f==0)break;
mf+=f;
}
//mf is the maxflow value, n-mf=mcbm, in a bipartite graph mcbm = mis (max independent set)
}
return 0;
}
| [
"[email protected]"
] | |
7de8422be9b8145b2418279d253c84d60eef52c5 | 8f5f13f74e63cbe9d8a28d60a649b9fece7b2146 | /OpenGL/src/5_advanced_lighting/3_15_deferred_lighting_with_SSAO_with_blur.cpp | f676fbbf29156d07db5b7de0b385ce991575d4d0 | [] | no_license | GameDevZone/OpenGL | 0a2c424405cd8f97efefb29bdc884df8fd31a97f | 1670e4d90187536eb0e477416f7d134431d142de | refs/heads/master | 2020-04-11T02:52:35.337836 | 2019-02-21T09:01:09 | 2019-02-21T09:01:09 | 161,459,704 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 25,404 | cpp | #include <glad/glad.h>
#include <GLFW/glfw3.h>
#include "../std_image.h"
#include "glm.hpp"
#include "gtc/matrix_transform.hpp"
#include "gtc/type_ptr.hpp"
#include "../Shader.h"
#include "../Camera.h"
#include "../Model.h"
#include <iostream>
#include <random>
#define WINDOW_WIDTH 1280
#define WINDOW_HEIGHT 720
const unsigned int SHADOW_WIDTH = 1024 * 2, SHADOW_HEIGHT = 1024 * 2;
void framebuffer_size_callback(GLFWwindow *Window, int width, int height);
void processInput(GLFWwindow *window);
void mouse_callback(GLFWwindow* window, double xpos, double ypos);
void scroll_callback(GLFWwindow* window, double xoffset, double yoffset);
unsigned int loadTexture(const char *path, bool gamma);
unsigned int loadSkyBox(std::vector<std::string> faces);
unsigned int createFrameBuffer(unsigned int textureColorBuffer, unsigned int renderBuffer, GLenum attch);
unsigned int createTextureBuffer(GLint internalFormat, GLenum format, GLenum type);
unsigned int createRenderBuffer(GLenum internalformat);
unsigned int createFloatFrameBuffer();
void renderCube();
void renderQuad();
float lerp(float a, float b, float t)
{
return a + b * (1 - t);
}
// camera
Camera camera(glm::vec3(0.0f, 0.0f, 5.0f));
bool firstMouse = true;
float lastX = WINDOW_WIDTH / 2.0;
float lastY = WINDOW_WIDTH / 2.0;
// delta time
float deltaTime = .0f;
float lastTime = .0f;
// switch diffuse color buffer
int startIndex = 0; // 0,1,2
bool switchKeyPressed = false;
#define max_index 3
float checkRaidus = 0.5f;
bool checkKeyPressed = false;
float power = 2.0f;
bool powerKeyPressed = false;
int main(void)
{
GLFWwindow* window;
if (!glfwInit())
return -1;
glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);
glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);
#ifdef __APPLE__
glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE);
#endif // __APPLE__
/* Create a windowed mode window and its OpenGL context */
window = glfwCreateWindow(WINDOW_WIDTH, WINDOW_HEIGHT, "Learn OpenGL", NULL, NULL);
if (!window)
{
std::cout << "Failed To Create GLFW Window" << std::endl;
glfwTerminate();
return -1;
}
glfwMakeContextCurrent(window);
if (!gladLoadGLLoader((GLADloadproc)glfwGetProcAddress))
{
std::cout << "Failed to initialize GLAD" << std::endl;
return -1;
}
glViewport(0, 0, WINDOW_WIDTH, WINDOW_HEIGHT);
glfwSetInputMode(window, GLFW_CURSOR, GLFW_CURSOR_DISABLED);
glfwSetFramebufferSizeCallback(window, framebuffer_size_callback);
glfwSetCursorPosCallback(window, mouse_callback);
glfwSetScrollCallback(window, scroll_callback);
glEnable(GL_DEPTH_TEST);
Shader deferredGeometryPass(
"shader/5_section_shaders/3_13_ssao_deferred_shading_geometry_pass.vs",
"shader/5_section_shaders/3_13_ssao_deferred_shading_geometry_pass.fs");
Shader ssaoCalcluate(
"shader/5_section_shaders/3_13_ssao_calcluate.vs",
"shader/5_section_shaders/3_13_ssao_calcluate.fs");
Shader ssaoShow(
"shader/5_section_shaders/3_13_show_ssao.vs",
"shader/5_section_shaders/3_13_show_ssao.fs");
Shader ssaoBlur(
"shader/5_section_shaders/3_14_ssao_blur.vs",
"shader/5_section_shaders/3_14_ssao_blur.fs");
Shader lightGeometryPass(
"shader/5_section_shaders/3_14_lighting_geomety_buffer_ssao_blur.vs",
"shader/5_section_shaders/3_14_lighting_geomety_buffer_ssao_blur.fs");
Shader lightObject(
"shader/5_section_shaders/3_12_deferred_lighting_box.vs",
"shader/5_section_shaders/3_12_deferred_lighting_box.fs");
ssaoBlur.Use();
ssaoBlur.SetInt("ssaoInput", 0);
lightGeometryPass.Use();
lightGeometryPass.SetInt("position", 0);
lightGeometryPass.SetInt("normal", 1);
lightGeometryPass.SetInt("albedo", 2);
lightGeometryPass.SetInt("ssao", 3);
ssaoCalcluate.Use();
ssaoCalcluate.SetInt("gPosition", 0);
ssaoCalcluate.SetInt("gNormal", 1);
ssaoCalcluate.SetInt("gNoise", 2);
ssaoShow.Use();
ssaoShow.SetInt("imageBuffer", 0);
Model nanosuit("Resources/objects/nanosuit/nanosuit.obj");
// create geometry buffer
unsigned int geometryBuffer;
glGenFramebuffers(1, &geometryBuffer);
glBindFramebuffer(GL_FRAMEBUFFER, geometryBuffer);
// color buffers
unsigned int positionBuffer, normalBuffer, albedoSpecBuffer;
glGenTextures(1, &positionBuffer);
glBindTexture(GL_TEXTURE_2D, positionBuffer);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB16F, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGB, GL_FLOAT, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, positionBuffer, 0);
glGenTextures(1, &normalBuffer);
glBindTexture(GL_TEXTURE_2D, normalBuffer);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB16F, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGB, GL_FLOAT, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT1, GL_TEXTURE_2D, normalBuffer, 0);
glGenTextures(1, &albedoSpecBuffer);
glBindTexture(GL_TEXTURE_2D, albedoSpecBuffer);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGBA, GL_UNSIGNED_BYTE, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT2, GL_TEXTURE_2D, albedoSpecBuffer, 0);
unsigned int attachments[3] = { GL_COLOR_ATTACHMENT0, GL_COLOR_ATTACHMENT1, GL_COLOR_ATTACHMENT2 };
glDrawBuffers(3, attachments);
// depth buffer
unsigned int depthRenderbuffer;
glGenRenderbuffers(1, &depthRenderbuffer);
glBindRenderbuffer(GL_RENDERBUFFER, depthRenderbuffer);
glRenderbufferStorage(GL_RENDERBUFFER, GL_DEPTH_COMPONENT, WINDOW_WIDTH, WINDOW_HEIGHT);
glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_RENDERBUFFER, depthRenderbuffer);
if (glCheckFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE)
std::cout << "Frame Buffer is not complete!!" << std::endl;
glBindFramebuffer(GL_FRAMEBUFFER, 0);
glm::vec3 lightPos = glm::vec3(2.0, 4.0, -2.0);
glm::vec3 lightColor = glm::vec3(0.2, 0.2, 0.7);
// sample kernel
std::uniform_real_distribution<float> randomFloats(0.0, 1.0);
std::default_random_engine generator;
std::vector<glm::vec3> ssaoKernel;
for (unsigned int i = 0; i < 64; i ++)
{
glm::vec3 sample(
randomFloats(generator) * 2.0 - 1.0, // x
randomFloats(generator) * 2.0 - 1.0, // y
randomFloats(generator) // z keep it in 0.0-1.0 cuz we using hemisphere
);
sample = glm::normalize(sample);
sample *= randomFloats(generator);
float scale = 1.0 / 64.0f;
scale = lerp(0.1f, 1.0f, scale * scale);
sample *= scale;
ssaoKernel.push_back(sample);
}
// random kernel rotaions
std::vector<glm::vec3> ssaoNoise;
for (unsigned int i = 0; i < 16; i++)
{
glm::vec3 rotation(
randomFloats(generator) * 2.0 - 1.0,
randomFloats(generator) * 2.0 - 1.0,
0.0f // we rotate along z axis
);
ssaoNoise.push_back(rotation);
}
// create noise texture
unsigned int noiseTexture;
glGenTextures(1, &noiseTexture);
glBindTexture(GL_TEXTURE_2D, noiseTexture);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB16F, 4, 4, 0, GL_RGB, GL_FLOAT, &ssaoNoise[0]);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);
// SSAO framebuffer
unsigned int ssaoFrameBuffer;
glGenFramebuffers(1, &ssaoFrameBuffer);
glBindFramebuffer(GL_FRAMEBUFFER, ssaoFrameBuffer);
unsigned int ssaoColorBuffer;
glGenTextures(1, &ssaoColorBuffer);
glBindTexture(GL_TEXTURE_2D, ssaoColorBuffer);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RED, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGB, GL_FLOAT, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);
//glDrawBuffer(GL_NONE);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, ssaoColorBuffer, 0);
if (glCheckFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE)
{
std::cout << "Create SSAO Frame buffer failed!!" << std::endl;
}
glBindFramebuffer(GL_FRAMEBUFFER, 0);
// SSAO framebuffer
unsigned int ssaoblurFrameBuffer;
glGenFramebuffers(1, &ssaoblurFrameBuffer);
glBindFramebuffer(GL_FRAMEBUFFER, ssaoblurFrameBuffer);
unsigned int ssaoblurColorBuffer;
glGenTextures(1, &ssaoblurColorBuffer);
glBindTexture(GL_TEXTURE_2D, ssaoblurColorBuffer);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RED, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGB, GL_FLOAT, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);
//glDrawBuffer(GL_NONE);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, ssaoblurColorBuffer, 0);
if (glCheckFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE)
{
std::cout << "Create SSAO Frame buffer failed!!" << std::endl;
}
while (!glfwWindowShouldClose(window))
{
float currentFrame = (float)glfwGetTime();
deltaTime = currentFrame - lastTime;
lastTime = currentFrame;
/* key input */
processInput(window);
glClearColor(0.2f, 0.2f, 0.2f, 1.f);
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
// 1. geometry pass
glBindFramebuffer(GL_FRAMEBUFFER, geometryBuffer);
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
glm::mat4 projection = glm::perspective(glm::radians(camera.Zoom), (float)WINDOW_WIDTH / (float)WINDOW_HEIGHT, 0.1f, 100.0f);
glm::mat4 view = camera.GetViewMatrix();
deferredGeometryPass.Use();
deferredGeometryPass.SetMat4("projection", projection);
deferredGeometryPass.SetMat4("view", view);
// room cube
glm::mat4 model = glm::mat4(1.0f);
model = glm::translate(model, glm::vec3(0.0, 7.0f, 0.0f));
model = glm::scale(model, glm::vec3(7.5f, 7.5f, 7.5f));
deferredGeometryPass.SetMat4("model", model);
deferredGeometryPass.SetInt("inverse_normal", 1); // invert normals as we're inside the cube
renderCube();
model = glm::mat4(1.0f);
deferredGeometryPass.SetInt("inverse_normal", 0);
// nanosuit model on the floor
model = glm::translate(model, glm::vec3(0.0f, 0.0f, 5.0));
model = glm::rotate(model, glm::radians(-90.0f), glm::vec3(1.0, 0.0, 0.0));
model = glm::scale(model, glm::vec3(0.5f));
deferredGeometryPass.SetMat4("model", model);
//model = glm::scale(model, glm::vec3(0.2f));
//model = glm::rotate(model, glm::radians(-90.0f), glm::vec3(1.0, 0.0, 0.0));
//model = glm::translate(model, glm::vec3(0.0, -2.0f, 0.0));
//deferredGeometryPass.SetMat4("model", model);
nanosuit.Draw(deferredGeometryPass);
glBindFramebuffer(GL_FRAMEBUFFER, 0);
// ssao factor
glBindFramebuffer(GL_FRAMEBUFFER, ssaoFrameBuffer);
glClear(GL_COLOR_BUFFER_BIT);
ssaoCalcluate.Use();
ssaoCalcluate.SetFloat("kernelSize", 64);
ssaoCalcluate.SetFloat("power", power);
ssaoCalcluate.SetFloat("radius", checkRaidus);
ssaoCalcluate.SetMat4("projection", projection);
glActiveTexture(GL_TEXTURE0);
glBindTexture(GL_TEXTURE_2D, positionBuffer);
glActiveTexture(GL_TEXTURE1);
glBindTexture(GL_TEXTURE_2D, normalBuffer);
glActiveTexture(GL_TEXTURE2);
glBindTexture(GL_TEXTURE_2D, albedoSpecBuffer);
//uniform vec3 samples[64];
for (unsigned int i = 0; i < 64; i ++)
{
ssaoCalcluate.SetVec3("samples[" + std::to_string(i) + "]", ssaoKernel[i]);
}
renderQuad();
glBindFramebuffer(GL_FRAMEBUFFER, 0);
// ssao blur
glBindFramebuffer(GL_FRAMEBUFFER, ssaoblurFrameBuffer);
ssaoBlur.Use();
glActiveTexture(GL_TEXTURE0);
glBindTexture(GL_TEXTURE_2D, ssaoColorBuffer);
renderQuad();
glBindFramebuffer(GL_FRAMEBUFFER, 0);
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
lightGeometryPass.Use();
glm::vec3 lightPosView = glm::vec3(camera.GetViewMatrix() * glm::vec4(lightPos, 1.0));
lightGeometryPass.SetVec3("light.Position", lightPosView);
lightGeometryPass.SetVec3("light.Color", lightColor);
const float constant = 1.0;
const float linear = 0.09;
const float quadratic = 0.032;
lightGeometryPass.SetFloat("light.Linear", linear);
lightGeometryPass.SetFloat("light.Quadratic", quadratic);
glActiveTexture(GL_TEXTURE0);
glBindTexture(GL_TEXTURE_2D, positionBuffer);
glActiveTexture(GL_TEXTURE1);
glBindTexture(GL_TEXTURE_2D, normalBuffer);
glActiveTexture(GL_TEXTURE2);
glBindTexture(GL_TEXTURE_2D, albedoSpecBuffer);
glActiveTexture(GL_TEXTURE3);
glBindTexture(GL_TEXTURE_2D, ssaoblurColorBuffer);
renderQuad();
glfwSwapBuffers(window);
glfwPollEvents();
}
/* clear all the stuff */
glfwTerminate();
return 0;
}
unsigned int cubeVAO = 0;
unsigned int cubeVBO = 0;
void renderCube()
{
// initialize (if necessary)
if (cubeVAO == 0)
{
float vertices[] = {
// back face
-1.0f, -1.0f, -1.0f, 0.0f, 0.0f, -1.0f, 0.0f, 0.0f, // bottom-left
1.0f, 1.0f, -1.0f, 0.0f, 0.0f, -1.0f, 1.0f, 1.0f, // top-right
1.0f, -1.0f, -1.0f, 0.0f, 0.0f, -1.0f, 1.0f, 0.0f, // bottom-right
1.0f, 1.0f, -1.0f, 0.0f, 0.0f, -1.0f, 1.0f, 1.0f, // top-right
-1.0f, -1.0f, -1.0f, 0.0f, 0.0f, -1.0f, 0.0f, 0.0f, // bottom-left
-1.0f, 1.0f, -1.0f, 0.0f, 0.0f, -1.0f, 0.0f, 1.0f, // top-left
// front face
-1.0f, -1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 0.0f, 0.0f, // bottom-left
1.0f, -1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 1.0f, 0.0f, // bottom-right
1.0f, 1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 1.0f, 1.0f, // top-right
1.0f, 1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 1.0f, 1.0f, // top-right
-1.0f, 1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 0.0f, 1.0f, // top-left
-1.0f, -1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 0.0f, 0.0f, // bottom-left
// left face
-1.0f, 1.0f, 1.0f, -1.0f, 0.0f, 0.0f, 1.0f, 0.0f, // top-right
-1.0f, 1.0f, -1.0f, -1.0f, 0.0f, 0.0f, 1.0f, 1.0f, // top-left
-1.0f, -1.0f, -1.0f, -1.0f, 0.0f, 0.0f, 0.0f, 1.0f, // bottom-left
-1.0f, -1.0f, -1.0f, -1.0f, 0.0f, 0.0f, 0.0f, 1.0f, // bottom-left
-1.0f, -1.0f, 1.0f, -1.0f, 0.0f, 0.0f, 0.0f, 0.0f, // bottom-right
-1.0f, 1.0f, 1.0f, -1.0f, 0.0f, 0.0f, 1.0f, 0.0f, // top-right
// right face
1.0f, 1.0f, 1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 0.0f, // top-left
1.0f, -1.0f, -1.0f, 1.0f, 0.0f, 0.0f, 0.0f, 1.0f, // bottom-right
1.0f, 1.0f, -1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 1.0f, // top-right
1.0f, -1.0f, -1.0f, 1.0f, 0.0f, 0.0f, 0.0f, 1.0f, // bottom-right
1.0f, 1.0f, 1.0f, 1.0f, 0.0f, 0.0f, 1.0f, 0.0f, // top-left
1.0f, -1.0f, 1.0f, 1.0f, 0.0f, 0.0f, 0.0f, 0.0f, // bottom-left
// bottom face
-1.0f, -1.0f, -1.0f, 0.0f, -1.0f, 0.0f, 0.0f, 1.0f, // top-right
1.0f, -1.0f, -1.0f, 0.0f, -1.0f, 0.0f, 1.0f, 1.0f, // top-left
1.0f, -1.0f, 1.0f, 0.0f, -1.0f, 0.0f, 1.0f, 0.0f, // bottom-left
1.0f, -1.0f, 1.0f, 0.0f, -1.0f, 0.0f, 1.0f, 0.0f, // bottom-left
-1.0f, -1.0f, 1.0f, 0.0f, -1.0f, 0.0f, 0.0f, 0.0f, // bottom-right
-1.0f, -1.0f, -1.0f, 0.0f, -1.0f, 0.0f, 0.0f, 1.0f, // top-right
// top face
-1.0f, 1.0f, -1.0f, 0.0f, 1.0f, 0.0f, 0.0f, 1.0f, // top-left
1.0f, 1.0f , 1.0f, 0.0f, 1.0f, 0.0f, 1.0f, 0.0f, // bottom-right
1.0f, 1.0f, -1.0f, 0.0f, 1.0f, 0.0f, 1.0f, 1.0f, // top-right
1.0f, 1.0f, 1.0f, 0.0f, 1.0f, 0.0f, 1.0f, 0.0f, // bottom-right
-1.0f, 1.0f, -1.0f, 0.0f, 1.0f, 0.0f, 0.0f, 1.0f, // top-left
-1.0f, 1.0f, 1.0f, 0.0f, 1.0f, 0.0f, 0.0f, 0.0f // bottom-left
};
glGenVertexArrays(1, &cubeVAO);
glGenBuffers(1, &cubeVBO);
// fill buffer
glBindBuffer(GL_ARRAY_BUFFER, cubeVBO);
glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);
// link vertex attributes
glBindVertexArray(cubeVAO);
glEnableVertexAttribArray(0);
glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 8 * sizeof(float), (void*)0);
glEnableVertexAttribArray(1);
glVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, 8 * sizeof(float), (void*)(3 * sizeof(float)));
glEnableVertexAttribArray(2);
glVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, 8 * sizeof(float), (void*)(6 * sizeof(float)));
glBindBuffer(GL_ARRAY_BUFFER, 0);
glBindVertexArray(0);
}
// render Cube
glBindVertexArray(cubeVAO);
glDrawArrays(GL_TRIANGLES, 0, 36);
glBindVertexArray(0);
}
unsigned int quadVAO = 0;
unsigned int quadVBO;
void renderQuad()
{
if (quadVAO == 0)
{
float quadVertices[] = {
// positions // texture Coords
-1.0f, 1.0f, 0.0f, 0.0f, 1.0f,
-1.0f, -1.0f, 0.0f, 0.0f, 0.0f,
1.0f, 1.0f, 0.0f, 1.0f, 1.0f,
1.0f, -1.0f, 0.0f, 1.0f, 0.0f,
};
// setup plane VAO
glGenVertexArrays(1, &quadVAO);
glGenBuffers(1, &quadVBO);
glBindVertexArray(quadVAO);
glBindBuffer(GL_ARRAY_BUFFER, quadVBO);
glBufferData(GL_ARRAY_BUFFER, sizeof(quadVertices), &quadVertices, GL_STATIC_DRAW);
glEnableVertexAttribArray(0);
glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 5 * sizeof(float), (void*)0);
glEnableVertexAttribArray(1);
glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 5 * sizeof(float), (void*)(3 * sizeof(float)));
}
glBindVertexArray(quadVAO);
glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);
glBindVertexArray(0);
}
void scroll_callback(GLFWwindow* window, double xoffset, double yoffset)
{
camera.ProcessMouseScroll((float)yoffset);
}
void mouse_callback(GLFWwindow* window, double xpos, double ypos)
{
if (firstMouse)
{
lastX = (float)xpos;
lastY = (float)ypos;
firstMouse = false;
}
float offsetX = (float)xpos - lastX;
float offsetY = lastY - (float)ypos;
lastX = (float)xpos;
lastY = (float)ypos;
camera.ProcessMouseMovement(offsetX, offsetY);
}
void framebuffer_size_callback(GLFWwindow *Window, int width, int height)
{
glViewport(0, 0, width, height);
}
void processInput(GLFWwindow *window)
{
float cameraSpeed = 2.5f * deltaTime;
if (glfwGetKey(window, GLFW_KEY_ESCAPE))
{
glfwSetWindowShouldClose(window, true);
}
if (glfwGetKey(window, GLFW_KEY_W) == GLFW_PRESS)
camera.ProcessKeyboard(FORWARD, deltaTime);
if (glfwGetKey(window, GLFW_KEY_S) == GLFW_PRESS)
camera.ProcessKeyboard(BACKWARD, deltaTime);
if (glfwGetKey(window, GLFW_KEY_A) == GLFW_PRESS)
camera.ProcessKeyboard(LEFT, deltaTime);
if (glfwGetKey(window, GLFW_KEY_D) == GLFW_PRESS)
camera.ProcessKeyboard(RIGHT, deltaTime);
if (glfwGetKey(window, GLFW_KEY_E) == GLFW_PRESS)
camera.ProcessKeyboard(DOWN, deltaTime);
if (glfwGetKey(window, GLFW_KEY_Q) == GLFW_PRESS)
camera.ProcessKeyboard(UP, deltaTime);
if (glfwGetKey(window, GLFW_KEY_SPACE) == GLFW_PRESS && !switchKeyPressed)
{
startIndex += 1;
if ((startIndex) > max_index)
startIndex = 0;
switchKeyPressed = true;
}
if (glfwGetKey(window, GLFW_KEY_SPACE) == GLFW_RELEASE)
{
switchKeyPressed = false;
}
if (glfwGetKey(window, GLFW_KEY_UP) == GLFW_PRESS && !checkKeyPressed)
{
checkRaidus += 0.01;
if ((checkRaidus) > 1.5f)
checkRaidus = 1.5f;
checkKeyPressed = true;
}
if (glfwGetKey(window, GLFW_KEY_UP) == GLFW_RELEASE)
{
checkKeyPressed = false;
}
if (glfwGetKey(window, GLFW_KEY_DOWN) == GLFW_PRESS && !checkKeyPressed)
{
checkRaidus -= 0.01;
if ((checkRaidus) < 0.0f)
checkRaidus = 0.0f;
checkKeyPressed = true;
}
if (glfwGetKey(window, GLFW_KEY_DOWN) == GLFW_RELEASE)
{
checkKeyPressed = false;
}
if (glfwGetKey(window, GLFW_KEY_LEFT) == GLFW_PRESS && !powerKeyPressed)
{
power *= 2;
if ((power) > 256.f)
power = 256.f;
powerKeyPressed = true;
}
if (glfwGetKey(window, GLFW_KEY_LEFT) == GLFW_RELEASE)
{
powerKeyPressed = false;
}
if (glfwGetKey(window, GLFW_KEY_RIGHT) == GLFW_PRESS && !powerKeyPressed)
{
power /= 2;
if ((power) < 1.f)
power = 1.f;
powerKeyPressed = true;
}
if (glfwGetKey(window, GLFW_KEY_RIGHT) == GLFW_RELEASE)
{
powerKeyPressed = false;
}
}
unsigned int createRenderBuffer(GLenum internalFormat)
{
// renderbuffer object
unsigned int renderBuffer;
glGenRenderbuffers(1, &renderBuffer);
glBindRenderbuffer(GL_RENDERBUFFER, renderBuffer);
glRenderbufferStorage(GL_RENDERBUFFER, internalFormat, WINDOW_WIDTH, WINDOW_HEIGHT);
glBindRenderbuffer(GL_RENDERBUFFER, 0);
return renderBuffer;
}
unsigned int createTextureBuffer(GLint interalFormat, GLenum format, GLenum type)
{
// texture attachment
unsigned int textureColorBuffer;
glGenTextures(1, &textureColorBuffer);
glBindTexture(GL_TEXTURE_2D, textureColorBuffer);
// glTexImage2D(GL_TEXTURE_2D, 0, interalFormat, WINDOW_WIDTH, WINDOW_HEIGHT, 0, format, type, NULL);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA16F, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGBA, GL_FLOAT, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
glBindTexture(GL_TEXTURE_2D, 0);
return textureColorBuffer;
}
unsigned int createFloatFrameBuffer()
{
unsigned int bloomFBO;
glGenFramebuffers(1, &bloomFBO);
// create floating point color buffer
unsigned int colorBuffer;
glGenTextures(1, &colorBuffer);
glBindTexture(GL_TEXTURE_2D, colorBuffer);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA16F, WINDOW_WIDTH, WINDOW_HEIGHT, 0, GL_RGBA, GL_FLOAT, NULL);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
// create depth buffer (renderbuffer)
unsigned int rboDepth;
glGenRenderbuffers(1, &rboDepth);
glBindRenderbuffer(GL_RENDERBUFFER, rboDepth);
glRenderbufferStorage(GL_RENDERBUFFER, GL_DEPTH_COMPONENT, WINDOW_WIDTH, WINDOW_HEIGHT);
// attach buffers
glBindFramebuffer(GL_FRAMEBUFFER, bloomFBO);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, colorBuffer, 0);
glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_RENDERBUFFER, rboDepth);
if (glCheckFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE)
std::cout << "Framebuffer not complete!" << std::endl;
glBindFramebuffer(GL_FRAMEBUFFER, 0);
return bloomFBO;
}
unsigned int createFrameBuffer(unsigned int textureColorBuffer, unsigned int renderBuffer, GLenum attach)
{
// configure frame buffer
unsigned int framebuffer;
glGenFramebuffers(1, &framebuffer);
glBindFramebuffer(GL_FRAMEBUFFER, framebuffer);
//glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, textureColorBuffer, 0);
//glFramebufferRenderbuffer(GL_FRAMEBUFFER, attach, GL_RENDERBUFFER, renderBuffer);
glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, textureColorBuffer, 0);
glFramebufferRenderbuffer(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_RENDERBUFFER, renderBuffer);
if (glCheckFramebufferStatus(GL_FRAMEBUFFER) != GL_FRAMEBUFFER_COMPLETE)
std::cout << __LINE__ << " ERROR::FRAMEBUFFER:: Framebuffer is not complete!" << std::endl;
glBindFramebuffer(GL_FRAMEBUFFER, 0);
return framebuffer;
}
unsigned int loadTexture(char const * path, bool gamma = false)
{
unsigned int textureID;
glGenTextures(1, &textureID);
int width, height, nrComponents;
unsigned char *data = stbi_load(path, &width, &height, &nrComponents, 0);
if (data)
{
GLenum dataFormat;
GLenum internalFormat;
if (nrComponents == 1)
{
internalFormat = dataFormat = GL_RED;
}
else if (nrComponents == 3)
{
internalFormat = gamma ? GL_SRGB : GL_RGB;
dataFormat = GL_RGB;
}
else if (nrComponents == 4)
{
internalFormat = gamma ? GL_SRGB_ALPHA : GL_RGBA;
dataFormat = GL_RGBA;
}
glBindTexture(GL_TEXTURE_2D, textureID);
glTexImage2D(GL_TEXTURE_2D, 0, internalFormat, width, height, 0, dataFormat, GL_UNSIGNED_BYTE, data);
glGenerateMipmap(GL_TEXTURE_2D);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
stbi_image_free(data);
}
else
{
std::cout << "Texture failed to load at path: " << path << std::endl;
stbi_image_free(data);
}
return textureID;
}
unsigned int loadSkyBox(std::vector<std::string> faces)
{
unsigned int skyboxTextureID;
glGenTextures(1, &skyboxTextureID);
glBindTexture(GL_TEXTURE_CUBE_MAP, skyboxTextureID);
int width, height, nrChannels;
for (unsigned int i = 0; i < faces.size(); i++)
{
unsigned char* data = stbi_load(faces[i].c_str(), &width, &height, &nrChannels, 0);
if (data)
{
glTexImage2D(GL_TEXTURE_CUBE_MAP_POSITIVE_X + i,
0, GL_RGB, width, height, 0, GL_RGB, GL_UNSIGNED_BYTE, data);
stbi_image_free(data);
}
else
{
std::cout << "Cubemap texture failed to load at path: " << faces[i] << std::endl;
stbi_image_free(data);
}
}
glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_CUBE_MAP, GL_TEXTURE_WRAP_R, GL_CLAMP_TO_EDGE);
return skyboxTextureID;
} | [
"[email protected]"
] | |
bc2bfc8bbf202f7adf914d9b06690c13fe892768 | e58a4f1b096b9544ef56f865afe9f079d3fc89db | /Graphs/breadth_first_search_in_graphs.cc | 92bda9a92f974211793494933103aa3efe7b51ab | [] | no_license | 0APOCALYPSE0/Algorithm-Concepts | c14c27ba967f524202ed9be8a79428bfc01e5dc0 | 587f620dc5b1481790987a86ef34225899d4f35d | refs/heads/master | 2023-06-13T08:05:02.208567 | 2021-07-04T22:32:25 | 2021-07-04T22:32:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,305 | cc | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
template<typename T>
class Graph{
map<T,list<T>> adjList;
public:
Graph(){}
// Function To add the nodes into the graph.
void addEdge(T src,T des,bool bidir = true){
adjList[src].push_back(des);
if(bidir){
adjList[des].push_back(src);
}
}
// Printing the adjecency List.
void printAdjList(){
for(auto src : adjList) {
cout << src.first << " -> ";
for(auto des : src.second) {
cout << des << ", ";
}
cout << endl;
}
}
// Traversing the graph using B.F.S Technique.
void BFS(T src){
queue<T> Q;
map<T,bool> visited;
Q.push(src);
visited[src] = true;
while(!Q.empty()) {
T cur_node = Q.front();
Q.pop();
cout << cur_node << " ";
for(auto node : adjList[cur_node]) {
if(!visited[node]) {
Q.push(node);
visited[node] = true;
}
}
}
}
};
int main(){
#ifndef ONLINE_JUGDE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("error.txt","w",stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
Graph<int> ga;
ga.addEdge(0,1);
ga.addEdge(0,4);
ga.addEdge(4,3);
ga.addEdge(1,4);
ga.addEdge(1,2);
ga.addEdge(2,3);
ga.addEdge(1,3);
ga.BFS(0);
return 0;
}
// Sample Outout :
// 0 1 4 2 3 | [
"ajaysharma388"
] | ajaysharma388 |
80f7c532559ad444bd1aaf29b105c279c18a08db | f0bba79c584a12c8461c4650572953ef719cbbaf | /include/core/gpumemory.h | a92e1456fc464f503e0370e4e4cba98637e90127 | [] | no_license | YYXXYYZZ/soft-renderer | 88490cf1665dc4ba49c77817a181cb9118dfc800 | f4300575b967fc6035b4b41df441182554ce8c45 | refs/heads/master | 2021-11-25T10:46:08.291477 | 2014-10-29T07:57:29 | 2014-10-29T07:57:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,486 | h | #ifndef GPUMEMORY_H
#define GPUMEMORY_H
#include <map>
#include <cstring>
#include <typeindex>
#include <iostream>
#include <exception>
using std::string;
using std::map;
using std::type_index;
namespace GPUMemory {
struct MemoryInfo{
void * address;
int size;
string type;
};
typedef map<string,MemoryInfo> DataMap;
extern DataMap Global_Data;
template<class T>
bool alloc(const string& name, const int & size,T *&pointer){
try{
Global_Data.at(name);
std::cerr << "Warning: alloc exist element! " << name << std::endl;
return false;
}
catch(const std::out_of_range & ){
MemoryInfo info;
T *data = new T[size]();
info.address = static_cast<void *>(data);
info.size = size;
info.type = typeid(T).name();
Global_Data[name] = info;
pointer = data;
}
return true;
}
template<class T>
bool alloc(const string& name, const int & size){
try{
Global_Data.at(name);
std::cerr << "Warning: alloc exist element! " << name << std::endl;
return false;
}
catch(const std::out_of_range & ){
MemoryInfo info;
T *data = new T[size]();
info.address = static_cast<void *>(data);
info.size = size;
info.type = typeid(T).name();
Global_Data[name] = info;
}
return true;
}
template<class T>
void dealloc(const string& name)
{
try{
MemoryInfo info = Global_Data.at(name);
if (info.type != typeid(T).name()) {
std::cerr << "Warning: dealloc a different type elemet! " << name << std::endl;
return;
}
T * data = static_cast<T *>(info.address);
delete []data;
Global_Data.erase(name);
}
catch(const std::out_of_range & ){
std::cerr << "Warning: dealloc none-exist element! " << name << std::endl;
}
}
template<class T>
bool memoryCopy(const string &name, const int &size, T *in_data)
{
try{
MemoryInfo mem_info = Global_Data.at(name);
if (size > mem_info.size) {
std::cerr << "Warning: memory copy to a smaller space! " << name << std::endl;
return false;
}
if(mem_info.type != typeid(T).name()){
std::cerr << "Warning: memory copy to a different type! " << name << std::endl;
return false;
}
// This is an insidious bug! can not use memcpy here, for it may copy a pointer
// based data type !
T *dest = static_cast<T *>(mem_info.address);
for (int i = 0; i < size; ++i) {
dest[i] = in_data[i];
}
return true;
}
catch(const std::out_of_range & ){
std::cerr << "Warning: memory copy to none-exist element! " << name << std::endl;
}
return false;
}
template<class T>
bool retrieve(const std::string &name,int &size,T *&out_data)
{
try{
MemoryInfo mem_info = Global_Data.at(name);
if(mem_info.type != typeid(T).name()){
std::cerr << "Warning: retrieve to a different type! " << name << std::endl;
out_data = NULL;
return false;
}
out_data = static_cast<T *>(mem_info.address);
size = mem_info.size;
return true;
}
catch(const std::out_of_range & ){
std::cerr << "Warning: retrieve none-exist element! " << name << std::endl;
}
size = 0;
out_data = NULL;
return false;
}
} //namespace
#endif // GPUMEMORY_H
| [
"[email protected]"
] | |
7b040c87258aa6fe094d601d6f589386390d4bd5 | 15612c6affbeb98781e19f7de0d3f1db72cf1db9 | /include/utility/relation_node.hpp | 97e5891a725439904d443bf8903a71bbf70d4c53 | [
"Apache-2.0"
] | permissive | federeghe/chronovise | 332ad62ab046a2ff8ed1d03cf7e66a366717b630 | 4b332f10669af73f33e00f8749040eed9601bfb2 | refs/heads/master | 2023-02-24T05:25:51.369574 | 2021-12-08T10:31:26 | 2021-12-08T10:31:26 | 111,384,255 | 3 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 2,009 | hpp | /*
* chronovise - Copyright 2018 Politecnico di Milano
*
* 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.
*/
/**
* @file utility/relation_node.hpp
* @author Check commit authors
* @brief File containing the RelationNode and related classes/types
*/
#ifndef UTILITY_RELATION_NODE_HPP_
#define UTILITY_RELATION_NODE_HPP_
#include <list>
#include <memory>
#include <numeric>
namespace chronovise {
typedef enum class relation_node_e {
UKNOWN, /** Error value, it should not be used */
TEST, /** Statistical test */
OPERATOR, /** Operator */
} relation_node_t;
class RelationNode {
public:
RelationNode(relation_node_t type) : type(type)
{
}
virtual ~RelationNode()
{
}
relation_node_t get_type() const noexcept { return this->type; }
void add_child(std::shared_ptr<RelationNode> rn);
std::list<std::shared_ptr<RelationNode>>::const_iterator cbegin() const noexcept {
return this->children.cbegin();
}
std::list<std::shared_ptr<RelationNode>>::const_iterator cend() const noexcept {
return this->children.cend();
}
const std::list<std::shared_ptr<RelationNode>> & get_children() const noexcept {
return this->children;
}
size_t get_local_size() const noexcept {
return this->children.size();
}
size_t get_total_size() const noexcept;
private:
relation_node_t type;
std::list<std::shared_ptr<RelationNode>> children;
};
} // namespace chronovise
#endif
| [
"[email protected]"
] | |
d7a556185663cc98990de49e3175279a6e05f520 | 37421955fdae8ab64fa65c4fa91a6b2622bc14ef | /common/camera.h | 99fbafcb7fdf33da12cbd11b8b3e59f06dd905d0 | [] | no_license | SasaWakaba/Stelemate | c8ac4f49e4116911c044a9f559437c9b82d464bd | 20c003206ff3ba2b987ef978a98c8fe0514f87ab | refs/heads/master | 2020-09-05T18:52:41.011485 | 2020-03-29T11:53:39 | 2020-03-29T11:53:39 | 220,181,236 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 857 | h | #pragma once
#include "Game_Object.h"
class CCamera:public CGameObject
{
private:
XMMATRIX m_ViewMatrix;
RECT m_Viewport;
static XMFLOAT3 m_Eye; //カメラ座標
static XMFLOAT3 m_at; //見てる場所(注視点)
XMFLOAT3 m_CameraFront; //カメラの正面、長さ１
XMFLOAT3 m_CameraRight; //カメラの右側、長さ１
XMFLOAT3 m_CameraUp; //カメラの上、長さ１
float m_Length; //見てる場所までの長さ
static bool bMove;
static XMFLOAT3 MoveLength;
static int cnt;
public:
void Initialize();
void Finalize();
void Update();
void Draw();
XMMATRIX* GetView();
static void SetAt(XMFLOAT3 pos) { m_at = pos; }
static void Move(XMFLOAT3 at) {
MoveLength = XMFLOAT3(at.x - m_at.x, at.y - m_at.y, at.z - m_at.z);
bMove = true;
cnt = 0;
}
static XMFLOAT3 GetEye() { return m_Eye; }
}; | [
"[email protected]"
] | |
dde61d24a8ec8ab0aa669234ad4b8f9cccd4ccab | efa0c247b3d0636c14e83d548b407024c1aa594d | /core/pygmy_console.cpp | 7af2dae02f36841429a8f8c995480e174b061002 | [] | no_license | WarrenDGreenway/pygmyos | 2729dd6e1fb6e80081a7660de3d00fb148ddacb5 | f1738456a974c680539101e223a0e608e8564f52 | refs/heads/master | 2020-05-30T04:26:22.628394 | 2014-06-24T04:08:07 | 2014-06-24T04:08:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,260 | cpp | /**************************************************************************
PygmyOS ( Pygmy Operating System ) - BootLoader
Copyright (C) 2011-2012 Warren D Greenway
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 <http://www.gnu.org/licenses/>.
***************************************************************************/
#include <vector>
#include "pygmy_string.h"
#include "pygmy_console.h"
#include "pygmy_command.h"
using namespace std;
void Console::init( void )
{
Command action( (void*)this, (void *)Console::run, "\r" );
this->RXBuffer->addAction( action );
commands = vector<Command>(); // initialize the command vector
//this->commands.insert( new Command( (void *)Console::uname, "uname" ) );
this->commands.push_back( Command( (void *)this, (void *)Console::uname, "uname" ) );
//this->print( "\nsize in constructor: %d", this->commands.size() );
}
void Console::init( vector<Command>&commands )
{
this->commands = commands;
}
/*
bool Console::run( const char *s )
{
PygmyString tmpString( s );
this->run( tmpString );
}
bool Console::run( PygmyString& s )
{
}*/
bool Console::run( void *c, PygmyString& s )
{
Console *console = (Console*)c;
bool status;
int size = console->commands.size();
//console->print( "\ns: %s", s.c_str() );
for( int i = 0; i < console->commands.size(); i++ ){
if( s.startsWith( console->commands[ i ].getName() ) ){
CommandFunctionPointer handler = (CommandFunctionPointer)console->commands[ i ].getHandler();
// todo: erase the command from string before passing to handler
status = handler( console, s );
if( status == false ){
console->print( "\nError\n>" );
} // if
return( status );
} // if
} // for
// no match was found
}
bool Console::uname( void *c, PygmyString& s )
{
Console *console = (Console*)c;
console->print( "\nuname not implemented" );
}
bool Console::analog( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::pinconfig( void *c, PygmyString& s )
{
Console *console = (Console*)c;
PYGMYPARAMLIST parameters;
if( s.getAllParameters( ¶meters ) && parameters.ParamCount == 2 ){
/*if( pinConfig( convertStringToPin( parameters.Params[ 0 ] ), s.convertStringToMode( Parameters.Params[ 1 ] ) ) ){
freeParameterList( &Parameters );
return( TRUE );
} // if
*/
} // if
return( false );
}
bool Console::pinget( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::pinpwm( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::pinset( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
//bool cmd_set( PygmyString& s );
//bool cmd_erase( PygmyString& s );
bool Console::format( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::rx( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::tx( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::read( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::rm( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::cd( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::append( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::open( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
/*bool Console::new( vid *, PygmyString& s )
{
Console *console = (Console*)c;
}*/
bool Console::mkdir( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::rmdir( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
//bool cmd_echo( PygmyString& s );
bool Console::cat( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::strings( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::dump( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::ls( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::touch( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::mv( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::cp( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::reset( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::boot( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::flash( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::fdisk( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::umount( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::mount( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::verify( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::test( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::date( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::time( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::find( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::df( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::du( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::pwd( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::tail( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::cksum( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
//bool Console::if( PygmyString& s );
bool Console::sleep( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::lsof( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::gawk( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::declare( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::dc( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::kill( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
bool Console::killall( void *c, PygmyString& s )
{
Console *console = (Console*)c;
}
//bool cmd_null( PygmyString& s );
//bool cmd_cmd( PygmyString& s );
//bool cmd_run( PygmyString& s );*/
| [
"[email protected]"
] | |
9d82c3f45d9417342d4cf95f55276234ac428495 | 5e191124f3ae3cb374500b392123b75475b55030 | /tpl/gtest-mpi-listener/gtest-mpi-listener.hpp | 44e9578e1ce67de5d4439d3767c93977c52f8a39 | [
"BSD-3-Clause"
] | permissive | LLNL/MPIDiff | 501056918b6c49c8970b284251f73bbd7e62b089 | f7e24ce6ba4c2139424b26707742a7124ac8a045 | refs/heads/develop | 2023-06-30T16:45:28.039741 | 2021-08-04T15:45:09 | 2021-08-04T15:45:09 | 321,845,944 | 4 | 0 | BSD-3-Clause | 2021-08-04T15:45:10 | 2020-12-16T02:31:35 | C++ | UTF-8 | C++ | false | false | 19,412 | hpp | /******************************************************************************
*
* Slight modifications made by Alan Dayton (2019)
*
*******************************************************************************/
//
/******************************************************************************
*
* Copyright (c) 2016-2018, Lawrence Livermore National Security, LLC
* and other gtest-mpi-listener developers. See the COPYRIGHT file for details.
*
* SPDX-License-Identifier: (Apache-2.0 OR MIT)
*
*******************************************************************************/
//
/*******************************************************************************
* An example from Google Test was copied with minor modifications. The
* license of Google Test is below.
*
* Google Test has the following copyright notice, which must be
* duplicated in its entirety per the terms of its license:
*
* Copyright 2005, Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*******************************************************************************/
#ifndef GTEST_MPI_MINIMAL_LISTENER_H
#define GTEST_MPI_MINIMAL_LISTENER_H
#include "mpi.h"
#include "gtest/gtest.h"
#include <cassert>
#include <vector>
#include <string>
#include <sstream>
#include "mpidiff/MPIDiff.h"
namespace GTestMPIListener
{
// This class sets up the global test environment, which is needed
// to finalize MPI.
class MPIEnvironment : public ::testing::Environment {
public:
MPIEnvironment() : ::testing::Environment() {}
virtual ~MPIEnvironment() {}
virtual void SetUp() {
int is_mpi_initialized;
ASSERT_EQ(MPI_Initialized(&is_mpi_initialized), MPI_SUCCESS);
if (!is_mpi_initialized) {
printf("MPI must be initialized before RUN_ALL_TESTS!\n");
printf("Add '::testing::InitGoogleTest(&argc, argv);\n");
printf(" MPI_Init(&argc, &argv);' to your 'main' function!\n");
FAIL();
}
}
virtual void TearDown() {
int is_mpi_finalized;
ASSERT_EQ(MPI_Finalized(&is_mpi_finalized), MPI_SUCCESS);
if (!is_mpi_finalized) {
int rank;
ASSERT_EQ(MPI_Comm_rank(MPI_COMM_WORLD, &rank), MPI_SUCCESS);
if (rank == 0) { printf("Finalizing MPI...\n"); }
MPIDiff::Finalize();
ASSERT_EQ(MPI_Finalize(), MPI_SUCCESS);
}
ASSERT_EQ(MPI_Finalized(&is_mpi_finalized), MPI_SUCCESS);
ASSERT_TRUE(is_mpi_finalized);
}
private:
// Disallow copying
MPIEnvironment(const MPIEnvironment&) {}
}; // class MPIEnvironment
// This class more or less takes the code in Google Test's
// MinimalistPrinter example and wraps certain parts of it in MPI calls,
// gathering all results onto rank zero.
class MPIMinimalistPrinter : public ::testing::EmptyTestEventListener
{
public:
MPIMinimalistPrinter() : ::testing::EmptyTestEventListener(),
result_vector()
{
int is_mpi_initialized;
assert(MPI_Initialized(&is_mpi_initialized) == MPI_SUCCESS);
if (!is_mpi_initialized) {
printf("MPI must be initialized before RUN_ALL_TESTS!\n");
printf("Add '::testing::InitGoogleTest(&argc, argv);\n");
printf(" MPI_Init(&argc, &argv);' to your 'main' function!\n");
assert(0);
}
MPI_Comm_dup(MPI_COMM_WORLD, &comm);
UpdateCommState();
}
MPIMinimalistPrinter(MPI_Comm comm_) : ::testing::EmptyTestEventListener(),
result_vector()
{
int is_mpi_initialized;
assert(MPI_Initialized(&is_mpi_initialized) == MPI_SUCCESS);
if (!is_mpi_initialized) {
printf("MPI must be initialized before RUN_ALL_TESTS!\n");
printf("Add '::testing::InitGoogleTest(&argc, argv);\n");
printf(" MPI_Init(&argc, &argv);' to your 'main' function!\n");
assert(0);
}
MPI_Comm_dup(comm_, &comm);
UpdateCommState();
}
MPIMinimalistPrinter
(const MPIMinimalistPrinter& printer) {
int is_mpi_initialized;
assert(MPI_Initialized(&is_mpi_initialized) == MPI_SUCCESS);
if (!is_mpi_initialized) {
printf("MPI must be initialized before RUN_ALL_TESTS!\n");
printf("Add '::testing::InitGoogleTest(&argc, argv);\n");
printf(" MPI_Init(&argc, &argv);' to your 'main' function!\n");
assert(0);
}
MPI_Comm_dup(printer.comm, &comm);
UpdateCommState();
result_vector = printer.result_vector;
}
// Called before the Environment is torn down.
void OnEnvironmentTearDownStart()
{
int is_mpi_finalized;
assert(MPI_Finalized(&is_mpi_finalized) == MPI_SUCCESS);
if (!is_mpi_finalized) {
MPI_Comm_free(&comm);
}
}
// Called before a test starts.
virtual void OnTestStart(const ::testing::TestInfo& test_info) {
// Only need to report test start info on rank 0
if (rank == 0) {
printf("*** Test %s.%s starting.\n",
test_info.test_case_name(), test_info.name());
}
}
// Called after an assertion failure or an explicit SUCCESS() macro.
// In an MPI program, this means that certain ranks may not call this
// function if a test part does not fail on all ranks. Consequently, it
// is difficult to have explicit synchronization points here.
virtual void OnTestPartResult
(const ::testing::TestPartResult& test_part_result) {
result_vector.push_back(test_part_result);
}
// Called after a test ends.
virtual void OnTestEnd(const ::testing::TestInfo& test_info) {
int localResultCount = result_vector.size();
std::vector<int> resultCountOnRank(size, 0);
MPI_Gather(&localResultCount, 1, MPI_INT,
&resultCountOnRank[0], 1, MPI_INT,
0, comm);
if (rank != 0) {
// Nonzero ranks send constituent parts of each result to rank 0
for (int i = 0; i < localResultCount; i++) {
const ::testing::TestPartResult test_part_result = result_vector.at(i);
int resultStatus(test_part_result.failed());
std::string resultFileName(test_part_result.file_name());
int resultLineNumber(test_part_result.line_number());
std::string resultSummary(test_part_result.summary());
// Must add one for null termination
int resultFileNameSize(resultFileName.size()+1);
int resultSummarySize(resultSummary.size()+1);
MPI_Send(&resultStatus, 1, MPI_INT, 0, rank, comm);
MPI_Send(&resultFileNameSize, 1, MPI_INT, 0, rank, comm);
MPI_Send(&resultLineNumber, 1, MPI_INT, 0, rank, comm);
MPI_Send(&resultSummarySize, 1, MPI_INT, 0, rank, comm);
MPI_Send(resultFileName.c_str(), resultFileNameSize, MPI_CHAR,
0, rank, comm);
MPI_Send(resultSummary.c_str(), resultSummarySize, MPI_CHAR,
0, rank, comm);
}
} else {
// Rank 0 first prints its local result data
for (int i = 0; i < localResultCount; i++) {
const ::testing::TestPartResult test_part_result = result_vector.at(i);
printf(" %s on rank %d, %s:%d\n%s\n",
test_part_result.failed() ? "*** Failure" : "Success",
rank,
test_part_result.file_name(),
test_part_result.line_number(),
test_part_result.summary());
}
for (int r = 1; r < size; r++) {
for (int i = 0; i < resultCountOnRank[r]; i++) {
int resultStatus, resultFileNameSize, resultLineNumber;
int resultSummarySize;
MPI_Recv(&resultStatus, 1, MPI_INT, r, r, comm, MPI_STATUS_IGNORE);
MPI_Recv(&resultFileNameSize, 1, MPI_INT, r, r, comm,
MPI_STATUS_IGNORE);
MPI_Recv(&resultLineNumber, 1, MPI_INT, r, r, comm,
MPI_STATUS_IGNORE);
MPI_Recv(&resultSummarySize, 1, MPI_INT, r, r, comm,
MPI_STATUS_IGNORE);
std::string resultFileName;
std::string resultSummary;
resultFileName.resize(resultFileNameSize);
resultSummary.resize(resultSummarySize);
MPI_Recv(&resultFileName[0], resultFileNameSize,
MPI_CHAR, r, r, comm, MPI_STATUS_IGNORE);
MPI_Recv(&resultSummary[0], resultSummarySize,
MPI_CHAR, r, r, comm, MPI_STATUS_IGNORE);
printf(" %s on rank %d, %s:%d\n%s\n",
resultStatus ? "*** Failure" : "Success",
r,
resultFileName.c_str(),
resultLineNumber,
resultSummary.c_str());
}
}
printf("*** Test %s.%s ending.\n",
test_info.test_case_name(), test_info.name());
}
result_vector.clear();
}
private:
MPI_Comm comm;
int rank;
int size;
std::vector< ::testing::TestPartResult > result_vector;
int UpdateCommState()
{
int flag = MPI_Comm_rank(comm, &rank);
if (flag != MPI_SUCCESS) { return flag; }
flag = MPI_Comm_size(comm, &size);
return flag;
}
}; // class MPIMinimalistPrinter
// This class more or less takes the code in Google Test's
// MinimalistPrinter example and wraps certain parts of it in MPI calls,
// gathering all results onto rank zero.
class MPIWrapperPrinter : public ::testing::TestEventListener
{
public:
MPIWrapperPrinter(::testing::TestEventListener *l, MPI_Comm comm_) :
::testing::TestEventListener(), listener(l), result_vector()
{
int is_mpi_initialized;
assert(MPI_Initialized(&is_mpi_initialized) == MPI_SUCCESS);
if (!is_mpi_initialized) {
printf("MPI must be initialized before RUN_ALL_TESTS!\n");
printf("Add '::testing::InitGoogleTest(&argc, argv);\n");
printf(" MPI_Init(&argc, &argv);' to your 'main' function!\n");
assert(0);
}
MPI_Comm_dup(comm_, &comm);
UpdateCommState();
}
MPIWrapperPrinter
(const MPIWrapperPrinter& printer) :
listener(printer.listener), result_vector(printer.result_vector) {
int is_mpi_initialized;
assert(MPI_Initialized(&is_mpi_initialized) == MPI_SUCCESS);
if (!is_mpi_initialized) {
printf("MPI must be initialized before RUN_ALL_TESTS!\n");
printf("Add '::testing::InitGoogleTest(&argc, argv);\n");
printf(" MPI_Init(&argc, &argv);' to your 'main' function!\n");
assert(0);
}
MPI_Comm_dup(printer.comm, &comm);
UpdateCommState();
}
// Called before test activity starts
virtual void OnTestProgramStart(const ::testing::UnitTest &unit_test)
{
if (rank == 0) { listener->OnTestProgramStart(unit_test); }
}
// Called before each test iteration starts, where iteration is
// the iterate index. There could be more than one iteration if
// GTEST_FLAG(repeat) is used.
virtual void OnTestIterationStart(const ::testing::UnitTest &unit_test,
int iteration)
{
if (rank == 0) { listener->OnTestIterationStart(unit_test, iteration); }
}
// Called before environment setup before start of each test iteration
virtual void OnEnvironmentsSetUpStart(const ::testing::UnitTest &unit_test)
{
if (rank == 0) { listener->OnEnvironmentsSetUpStart(unit_test); }
}
virtual void OnEnvironmentsSetUpEnd(const ::testing::UnitTest &unit_test)
{
if (rank == 0) { listener->OnEnvironmentsSetUpEnd(unit_test); }
}
#ifndef GTEST_REMOVE_LEGACY_TEST_CASEAPI_
virtual void OnTestCaseStart(const ::testing::TestCase &test_case)
{
if (rank == 0) { listener->OnTestCaseStart(test_case); }
}
#endif // GTEST_REMOVE_LEGACY_TEST_CASEAPI_
// Called before a test starts.
virtual void OnTestStart(const ::testing::TestInfo& test_info) {
// Only need to report test start info on rank 0
if (rank == 0) { listener->OnTestStart(test_info); }
}
// Called after an assertion failure or an explicit SUCCESS() macro.
// In an MPI program, this means that certain ranks may not call this
// function if a test part does not fail on all ranks. Consequently, it
// is difficult to have explicit synchronization points here.
virtual void OnTestPartResult
(const ::testing::TestPartResult& test_part_result) {
result_vector.push_back(test_part_result);
if (rank == 0) { listener->OnTestPartResult(test_part_result); }
}
// Called after a test ends.
virtual void OnTestEnd(const ::testing::TestInfo& test_info) {
int localResultCount = result_vector.size();
std::vector<int> resultCountOnRank(size, 0);
MPI_Gather(&localResultCount, 1, MPI_INT,
&resultCountOnRank[0], 1, MPI_INT,
0, comm);
if (rank != 0) {
// Nonzero ranks send constituent parts of each result to rank 0
for (int i = 0; i < localResultCount; i++) {
const ::testing::TestPartResult test_part_result = result_vector.at(i);
int resultStatus(test_part_result.failed());
std::string resultFileName(test_part_result.file_name());
int resultLineNumber(test_part_result.line_number());
std::string resultMessage(test_part_result.message());
int resultFileNameSize(resultFileName.size());
int resultMessageSize(resultMessage.size());
MPI_Send(&resultStatus, 1, MPI_INT, 0, rank, comm);
MPI_Send(&resultFileNameSize, 1, MPI_INT, 0, rank, comm);
MPI_Send(&resultLineNumber, 1, MPI_INT, 0, rank, comm);
MPI_Send(&resultMessageSize, 1, MPI_INT, 0, rank, comm);
MPI_Send(resultFileName.c_str(), resultFileNameSize, MPI_CHAR,
0, rank, comm);
MPI_Send(resultMessage.c_str(), resultMessageSize, MPI_CHAR,
0, rank, comm);
}
} else {
// Rank 0 first prints its local result data
for (int i = 0; i < localResultCount; i++) {
const ::testing::TestPartResult test_part_result = result_vector.at(i);
if (test_part_result.failed())
{
std::string message(test_part_result.message());
std::istringstream input_stream(message);
std::stringstream to_stream_into_failure;
std::string line_as_string;
while (std::getline(input_stream, line_as_string))
{
to_stream_into_failure << "[Rank 0/" << size << "] "
<< line_as_string << std::endl;
}
ADD_FAILURE_AT(test_part_result.file_name(),
test_part_result.line_number()) <<
to_stream_into_failure.str();
}
}
for (int r = 1; r < size; r++) {
for (int i = 0; i < resultCountOnRank[r]; i++) {
int resultStatus, resultFileNameSize, resultLineNumber;
int resultMessageSize;
MPI_Recv(&resultStatus, 1, MPI_INT, r, r, comm, MPI_STATUS_IGNORE);
MPI_Recv(&resultFileNameSize, 1, MPI_INT, r, r, comm,
MPI_STATUS_IGNORE);
MPI_Recv(&resultLineNumber, 1, MPI_INT, r, r, comm,
MPI_STATUS_IGNORE);
MPI_Recv(&resultMessageSize, 1, MPI_INT, r, r, comm,
MPI_STATUS_IGNORE);
std::vector<char> fileNameBuffer(resultFileNameSize);
std::vector<char> messageBuffer(resultMessageSize);
MPI_Recv(&fileNameBuffer[0], resultFileNameSize,
MPI_CHAR, r, r, comm, MPI_STATUS_IGNORE);
MPI_Recv(&messageBuffer[0], resultMessageSize,
MPI_CHAR, r, r, comm, MPI_STATUS_IGNORE);
std::string resultFileName(fileNameBuffer.begin(),
fileNameBuffer.end());
std::string resultMessage(messageBuffer.begin(),
messageBuffer.end());
bool testPartHasFailed = (resultStatus == 1);
if (testPartHasFailed)
{
std::string message(resultMessage);
std::istringstream input_stream(message);
std::stringstream to_stream_into_failure;
std::string line_as_string;
while (std::getline(input_stream, line_as_string))
{
to_stream_into_failure << "[Rank " << r << "/" << size << "] "
<< line_as_string << std::endl;
}
ADD_FAILURE_AT(resultFileName.c_str(),
resultLineNumber) << to_stream_into_failure.str();
}
}
}
}
result_vector.clear();
if (rank == 0) { listener->OnTestEnd(test_info); }
}
#ifndef GTEST_REMOVE_LEGACY_TEST_CASEAPI_
virtual void OnTestCaseEnd(const ::testing::TestCase &test_case)
{
if (rank == 0) { listener->OnTestCaseEnd(test_case); }
}
#endif
// Called before the Environment is torn down.
virtual void OnEnvironmentsTearDownStart(const ::testing::UnitTest &unit_test)
{
int is_mpi_finalized;
assert(MPI_Finalized(&is_mpi_finalized) == MPI_SUCCESS);
if (!is_mpi_finalized) {
MPI_Comm_free(&comm);
}
if (rank == 0) { listener->OnEnvironmentsTearDownStart(unit_test); }
}
virtual void OnEnvironmentsTearDownEnd(const ::testing::UnitTest &unit_test)
{
if (rank == 0) { listener->OnEnvironmentsTearDownEnd(unit_test); }
}
virtual void OnTestIterationEnd(const ::testing::UnitTest &unit_test,
int iteration)
{
if (rank == 0) { listener->OnTestIterationEnd(unit_test, iteration); }
}
// Called when test driver program ends
virtual void OnTestProgramEnd(const ::testing::UnitTest &unit_test)
{
if (rank == 0) { listener->OnTestProgramEnd(unit_test); }
}
private:
// Use a pointer here instead of a reference because
// ::testing::TestEventListeners::Release returns a pointer
// (namely, one of type ::testing::TesteEventListener*).
::testing::TestEventListener *listener;
MPI_Comm comm;
int rank;
int size;
std::vector< ::testing::TestPartResult > result_vector;
int UpdateCommState()
{
int flag = MPI_Comm_rank(comm, &rank);
if (flag != MPI_SUCCESS) { return flag; }
flag = MPI_Comm_size(comm, &size);
return flag;
}
};
} // namespace GTestMPIListener
#endif /* GTEST_MPI_MINIMAL_LISTENER_H */
| [
"[email protected]"
] | |
31e6426075fb037ae514214f4ad1dfd0a400c303 | 3bd1a6c15e63cbbef0e60a02957fb01722139f47 | /RoverMain/RoverFi.cpp | 488a20f5efd01026cec120dfdc49967c9ed9d919 | [] | no_license | DynamicBrute/SARSRover | 447ed77d266686776b4c8f703eb7a384e609dc82 | 30c9b25914b842937abd1b0b169bf6f7527c12b1 | refs/heads/master | 2020-05-17T05:15:04.989202 | 2015-04-21T16:58:34 | 2015-04-21T16:58:34 | 33,909,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,626 | cpp | #include "RoverFi.h"
#include "GPS.h"
#include "GPIO.h"
#include "HMC5883.h"
//#include "RoverMain.h"
char ssid[] = "SARSNet";
// your network password
char password[] = "sarsrover";
WiFiClient debugClient;
//Server object, the argument is the port that it listens too
WiFiServer debugServer(3284);
WiFiServer mainServer(7277);
WiFiServer teleServer(8353);
WiFiClient teleClient;
boolean alreadyConnected, alreadyConnectedMain, alreadyConnectedTele;
//Connect to a WiFi network
void startWiFi()
{
// attempt to connect to Wifi network:
Serial.print("Attempting to connect to Network named: ");
// print the network name (SSID);
Serial.println(ssid);
// Connect to WPA/WPA2 network. Change this line if using open or WEP network:
//Serial.print("IP: ");
//Serial.println(WiFi.localIP());
//if(WiFi.localIP() == INADDR_NONE)
WiFi.beginNetwork(ssid, password);
/* while ( WiFi.status() != WL_CONNECTED) {
// print dots while we wait to connect
Serial.print(".");
delay(300);
}*/
Serial.println("\nYou're connected to the network");
Serial.println("Waiting for an ip address");
while (WiFi.localIP() == INADDR_NONE) {
// print dots while we wait for an ip addresss
Serial.print(".");
delay(300);
}
Serial.println("\nIP Address obtained");
// you're connected now, so print out the status:
printWifiStatus();
alreadyConnectedMain = false;
}
void printWifiStatus() {
// print the SSID of the network you're attached to:
Serial.print("SSID: ");
Serial.println(WiFi.SSID());
// print your WiFi shield's IP address:
IPAddress ip = WiFi.localIP();
Serial.print("IP Address: ");
Serial.println(ip);
// print the received signal strength:
long rssi = WiFi.RSSI();
Serial.print("signal strength (RSSI):");
Serial.print(rssi);
Serial.println(" dBm");
debugClient.print("SSID: ");
debugClient.println(WiFi.SSID());
// print your WiFi shield's IP address:
debugClient.print("IP Address: ");
debugClient.println(ip);
// print the received signal strength:
debugClient.print("signal strength (RSSI):");
debugClient.print(rssi);
debugClient.println(" dBm");
}
void waitForTarget()
{
//define a client object to connect to the server
WiFiClient mainClient;
//wait for a client to connect to the server
while(!alreadyConnectedMain)
{
//attempt to save a client connecting to the server
mainClient = mainServer.available();
//if a client is connected, begin communication
if (mainClient) {
if (!alreadyConnectedMain) {
// clead out the input buffer:
mainClient.flush();
Serial.println("We have a new client");
debugServer.println("We have a new client");
mainClient.println("Hello, client!");
alreadyConnectedMain = true;
}
}
delay(100);
delay(100);
}
Serial.println("writing");
debugClient.println("writing");
//mainServer.println("ready");
delay(1000);
//Strings to read in latitude and longitude from the client
char lat[50] = "";
char lon[50] = "";
int ind = 0;
//Wait for input to be on the buffer
while(!mainClient.available());
char destNum = '0';
while(!(destNum == '1' || destNum == '2' || destNum == '3'))
{
destNum = mainClient.read();
Serial.println(destNum);
}
if(destNum == '1')
{
tarLat = LAT1;
tarLon = LON1;
}
if(destNum == '2')
{
tarLat = LAT2;
tarLon = LON2;
}
if(destNum == '3')
{
tarLat = LAT3;
tarLon = LON3;
}
/*
//Read in characters from the input buffer until a new line character is reached
//this will be the latitude
while(mainClient.available())
{
char c = mainClient.read();
lat[ind] = c;
if(c == '\n')
{
lat[ind] = NULL;
break;
}
ind++;
}
ind = 0;
//Read in characters from the input buffer until a new line character is reached
//this will be the longitude
while(mainClient.available())
{
char c = mainClient.read();
lon[ind] = c;
if(c == '\n')
{
lon[ind] = NULL;
break;
}
ind++;
}
mainClient.stop();
//convert from a string to a float
tarLat = strtof(lat, NULL);
tarLon = strtof(lon, NULL);
//digitalWrite(LED1, LOW);
//tarLat = atof(lat);
//tarLon = atof(lon);*/
Serial.print("Lat: ");
Serial.print(lat);
Serial.print(" ");
Serial.println(tarLat, 6);
Serial.print("Lon: ");
Serial.print(lon);
Serial.print(" ");
Serial.println(tarLon, 6);
debugClient.print("Lat: ");
debugClient.print(lat);
debugClient.print(" ");
debugClient.println(tarLat, 6);
debugClient.print("Lon: ");
debugClient.print(lon);
debugClient.print(" ");
debugClient.println(tarLon, 6);
//Erick's
//tarLat = 28.504906f;
//tarLon = -81.457456f;
//apt
//tarLat = 28.582183f;
//tarLon = -81.202770f;
//apt 2
//tarLat = 28.582373f;
//tarLon = -81.202996f;
//curLat = 28.628811f;
//curLon = -81.199479f;
//mem mall
//tarLat = 28.603710f;
//tarLon = -81.199371f;
//matt's
//tarLat = 28.628391;
//tarLon = -81.200013;
}
void transmitTele()
{
Serial.println("tele");
while(!alreadyConnectedTele)
{
//attempt to save a client connecting to the server
teleClient = teleServer.available();
//if a client is connected, begin communication
if (teleClient) {
if (!alreadyConnectedTele) {
// clead out the input buffer:
teleClient.flush();
Serial.println("We have a new client");
alreadyConnectedTele = true;
}
}
}
for(int i = 0; i < 20; i++)
{
if (teleClient.available() > 0) {
// read the bytes incoming from the client:
char thisChar = teleClient.read();
// echo the bytes back to the client:
if(thisChar == '1')
teleServer.println(curSpeedKn * KNOTS_TO_MPS);
if(thisChar == '2')
teleServer.println(pollPing());
if(thisChar == '3')
teleServer.println(distToTar());
if(thisChar == '4')
teleServer.println(curLat);
if(thisChar == '5')
teleServer.println(curLon);
if(thisChar == '6')
teleServer.println(curHead);
// echo the bytes to the server as well:
Serial.println(thisChar);
}
}
}
| [
"[email protected]"
] | |
52a43133980c01041fea2209f911688d000885f0 | bd8cd86bc15d0249c1f369363a6b0c652e530f3f | /tools/caffe2ncnn.cpp | 0eff756aed3acf33275dc94177c85897406f4adb | [] | no_license | zjd1988/mtcnn_vs2017_based_on_ncnn | 85cd8a62be726aacbf44e431fdd0087abd2dd55d | 3487fa3a15dad51b152266086a0c84164d9e7392 | refs/heads/master | 2020-04-12T14:58:18.352752 | 2019-05-21T10:46:33 | 2019-05-21T10:46:33 | 162,566,929 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 28,601 | cpp | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy of the License at
//
// https://opensource.org/licenses/BSD-3-Clause
//
// 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 <stdio.h>
#include <limits.h>
#include <fstream>
#include <set>
#include <limits>
#include <algorithm>
#include <google/protobuf/io/coded_stream.h>
#include <google/protobuf/io/zero_copy_stream_impl.h>
#include <google/protobuf/text_format.h>
#include <google/protobuf/message.h>
#include "caffe.pb.h"
static inline size_t alignSize(size_t sz, int n)
{
return (sz + n-1) & -n;
}
// convert float to half precision floating point
static unsigned short float2half(float value)
{
// 1 : 8 : 23
union
{
unsigned int u;
float f;
} tmp;
tmp.f = value;
// 1 : 8 : 23
unsigned short sign = (tmp.u & 0x80000000) >> 31;
unsigned short exponent = (tmp.u & 0x7F800000) >> 23;
unsigned int significand = tmp.u & 0x7FFFFF;
// fprintf(stderr, "%d %d %d\n", sign, exponent, significand);
// 1 : 5 : 10
unsigned short fp16;
if (exponent == 0)
{
// zero or denormal, always underflow
fp16 = (sign << 15) | (0x00 << 10) | 0x00;
}
else if (exponent == 0xFF)
{
// infinity or NaN
fp16 = (sign << 15) | (0x1F << 10) | (significand ? 0x200 : 0x00);
}
else
{
// normalized
short newexp = exponent + (- 127 + 15);
if (newexp >= 31)
{
// overflow, return infinity
fp16 = (sign << 15) | (0x1F << 10) | 0x00;
}
else if (newexp <= 0)
{
// underflow
if (newexp >= -10)
{
// denormal half-precision
unsigned short sig = (significand | 0x800000) >> (14 - newexp);
fp16 = (sign << 15) | (0x00 << 10) | sig;
}
else
{
// underflow
fp16 = (sign << 15) | (0x00 << 10) | 0x00;
}
}
else
{
fp16 = (sign << 15) | (newexp << 10) | (significand >> 13);
}
}
return fp16;
}
static int quantize_weight(float *data, size_t data_length, std::vector<unsigned short>& float16_weights)
{
float16_weights.resize(data_length);
for (size_t i = 0; i < data_length; i++)
{
float f = data[i];
unsigned short fp16 = float2half(f);
float16_weights[i] = fp16;
}
// magic tag for half-precision floating point
return 0x01306B47;
}
static bool quantize_weight(float *data, size_t data_length, int quantize_level, std::vector<float> &quantize_table, std::vector<unsigned char> &quantize_index) {
assert(quantize_level != 0);
assert(data != NULL);
assert(data_length > 0);
if (data_length < static_cast<size_t>(quantize_level)) {
fprintf(stderr, "No need quantize,because: data_length < quantize_level");
return false;
}
quantize_table.reserve(quantize_level);
quantize_index.reserve(data_length);
// 1. Find min and max value
float max_value = std::numeric_limits<float>::min();
float min_value = std::numeric_limits<float>::max();
for (size_t i = 0; i < data_length; ++i)
{
if (max_value < data[i]) max_value = data[i];
if (min_value > data[i]) min_value = data[i];
}
float strides = (max_value - min_value) / quantize_level;
// 2. Generate quantize table
for (int i = 0; i < quantize_level; ++i)
{
quantize_table.push_back(min_value + i * strides);
}
// 3. Align data to the quantized value
for (size_t i = 0; i < data_length; ++i)
{
size_t table_index = int((data[i] - min_value) / strides);
table_index = std::min<float>(table_index, quantize_level - 1);
float low_value = quantize_table[table_index];
float high_value = low_value + strides;
// find a nearest value between low and high value.
float targetValue = data[i] - low_value < high_value - data[i] ? low_value : high_value;
table_index = int((targetValue - min_value) / strides);
table_index = std::min<float>(table_index, quantize_level - 1);
quantize_index.push_back(table_index);
}
return true;
}
static bool read_proto_from_text(const char* filepath, google::protobuf::Message* message)
{
std::ifstream fs(filepath, std::ifstream::in);
if (!fs.is_open())
{
fprintf(stderr, "open failed %s\n", filepath);
return false;
}
google::protobuf::io::IstreamInputStream input(&fs);
bool success = google::protobuf::TextFormat::Parse(&input, message);
fs.close();
return success;
}
static bool read_proto_from_binary(const char* filepath, google::protobuf::Message* message)
{
std::ifstream fs(filepath, std::ifstream::in | std::ifstream::binary);
if (!fs.is_open())
{
fprintf(stderr, "open failed %s\n", filepath);
return false;
}
google::protobuf::io::IstreamInputStream input(&fs);
google::protobuf::io::CodedInputStream codedstr(&input);
codedstr.SetTotalBytesLimit(INT_MAX, INT_MAX / 2);
bool success = message->ParseFromCodedStream(&codedstr);
fs.close();
return success;
}
int main(int argc, char** argv)
{
if (!(argc == 3 || argc == 5 || argc == 6))
{
fprintf(stderr, "Usage: %s [caffeproto] [caffemodel] [ncnnproto] [ncnnbin] [quantizelevel]\n", argv[0]);
return -1;
}
const char* caffeproto = argv[1];
const char* caffemodel = argv[2];
const char* ncnn_prototxt = argc >= 5 ? argv[3] : "ncnn.proto";
const char* ncnn_modelbin = argc >= 5 ? argv[4] : "ncnn.bin";
const char* quantize_param = argc == 6 ? argv[5] : "0";
int quantize_level = atoi(quantize_param);
if (quantize_level != 0 && quantize_level != 256 && quantize_level != 65536) {
fprintf(stderr, "%s: only support quantize level = 0, 256, or 65536", argv[0]);
return -1;
}
caffe::NetParameter proto;
caffe::NetParameter net;
// load
bool s0 = read_proto_from_text(caffeproto, &proto);
if (!s0)
{
fprintf(stderr, "read_proto_from_text failed\n");
return -1;
}
bool s1 = read_proto_from_binary(caffemodel, &net);
if (!s1)
{
fprintf(stderr, "read_proto_from_binary failed\n");
return -1;
}
FILE* pp = fopen(ncnn_prototxt, "wb");
FILE* bp = fopen(ncnn_modelbin, "wb");
// rename mapping for identical bottom top style
std::map<std::string, std::string> blob_name_decorated;
// bottom blob reference
std::map<std::string, int> bottom_reference;
// global definition line
// [layer count] [blob count]
int layer_count = proto.layer_size();
std::set<std::string> blob_names;
for (int i=0; i<layer_count; i++)
{
const caffe::LayerParameter& layer = proto.layer(i);
for (int j=0; j<layer.bottom_size(); j++)
{
std::string blob_name = layer.bottom(j);
if (blob_name_decorated.find(blob_name) != blob_name_decorated.end())
{
blob_name = blob_name_decorated[blob_name];
}
blob_names.insert(blob_name);
if (bottom_reference.find(blob_name) == bottom_reference.end())
{
bottom_reference[blob_name] = 1;
}
else
{
bottom_reference[blob_name] = bottom_reference[blob_name] + 1;
}
}
if (layer.bottom_size() == 1 && layer.top_size() == 1 && layer.bottom(0) == layer.top(0))
{
std::string blob_name = layer.top(0) + "_" + layer.name();
blob_name_decorated[layer.top(0)] = blob_name;
blob_names.insert(blob_name);
}
else
{
for (int j=0; j<layer.top_size(); j++)
{
std::string blob_name = layer.top(j);
blob_names.insert(blob_name);
}
}
}
// remove bottom_reference entry with reference equals to one
int splitncnn_blob_count = 0;
std::map<std::string, int>::iterator it = bottom_reference.begin();
while (it != bottom_reference.end())
{
if (it->second == 1)
{
bottom_reference.erase(it++);
}
else
{
splitncnn_blob_count += it->second;
// fprintf(stderr, "%s %d\n", it->first.c_str(), it->second);
++it;
}
}
fprintf(pp, "%lu %lu\n", layer_count + bottom_reference.size(), blob_names.size() + splitncnn_blob_count);
// populate
blob_name_decorated.clear();
int internal_split = 0;
for (int i=0; i<layer_count; i++)
{
const caffe::LayerParameter& layer = proto.layer(i);
// layer definition line, repeated
// [type] [name] [bottom blob count] [top blob count] [bottom blobs] [top blobs] [layer specific params]
fprintf(pp, "%-16s %-16s %d %d", layer.type().c_str(), layer.name().c_str(), layer.bottom_size(), layer.top_size());
for (int j=0; j<layer.bottom_size(); j++)
{
std::string blob_name = layer.bottom(j);
if (blob_name_decorated.find(layer.bottom(j)) != blob_name_decorated.end())
{
blob_name = blob_name_decorated[layer.bottom(j)];
}
if (bottom_reference.find(blob_name) != bottom_reference.end())
{
int refidx = bottom_reference[blob_name] - 1;
bottom_reference[blob_name] = refidx;
char splitsuffix[256];
sprintf(splitsuffix, "_splitncnn_%d", refidx);
blob_name = blob_name + splitsuffix;
}
fprintf(pp, " %s", blob_name.c_str());
}
// decorated
if (layer.bottom_size() == 1 && layer.top_size() == 1 && layer.bottom(0) == layer.top(0))
{
std::string blob_name = layer.top(0) + "_" + layer.name();
blob_name_decorated[layer.top(0)] = blob_name;
fprintf(pp, " %s", blob_name.c_str());
}
else
{
for (int j=0; j<layer.top_size(); j++)
{
std::string blob_name = layer.top(j);
fprintf(pp, " %s", blob_name.c_str());
}
}
// find blob binary by layer name
int netidx;
for (netidx=0; netidx<net.layer_size(); netidx++)
{
if (net.layer(netidx).name() == layer.name())
{
break;
}
}
// layer specific params
if (layer.type() == "BatchNorm")
{
const caffe::LayerParameter& binlayer = net.layer(netidx);
const caffe::BlobProto& mean_blob = binlayer.blobs(0);
const caffe::BlobProto& var_blob = binlayer.blobs(1);
fprintf(pp, " %d", (int)mean_blob.data_size());
const caffe::BatchNormParameter& batch_norm_param = layer.batch_norm_param();
float eps = batch_norm_param.eps();
std::vector<float> ones(mean_blob.data_size(), 1.f);
fwrite(ones.data(), sizeof(float), ones.size(), bp);// slope
if (binlayer.blobs_size() < 3)
{
fwrite(mean_blob.data().data(), sizeof(float), mean_blob.data_size(), bp);
float tmp;
for (int j=0; j<var_blob.data_size(); j++)
{
tmp = var_blob.data().data()[j] + eps;
fwrite(&tmp, sizeof(float), 1, bp);
}
}
else
{
float scale_factor = 1 / binlayer.blobs(2).data().data()[0];
// premultiply scale_factor to mean and variance
float tmp;
for (int j=0; j<mean_blob.data_size(); j++)
{
tmp = mean_blob.data().data()[j] * scale_factor;
fwrite(&tmp, sizeof(float), 1, bp);
}
for (int j=0; j<var_blob.data_size(); j++)
{
tmp = var_blob.data().data()[j] * scale_factor + eps;
fwrite(&tmp, sizeof(float), 1, bp);
}
}
std::vector<float> zeros(mean_blob.data_size(), 0.f);
fwrite(zeros.data(), sizeof(float), zeros.size(), bp);// bias
}
else if (layer.type() == "Convolution")
{
const caffe::LayerParameter& binlayer = net.layer(netidx);
const caffe::BlobProto& weight_blob = binlayer.blobs(0);
const caffe::ConvolutionParameter& convolution_param = layer.convolution_param();
fprintf(pp, " %d %d %d %d %d %d %d", convolution_param.num_output(), convolution_param.kernel_size(0),
convolution_param.dilation_size() != 0 ? convolution_param.dilation(0) : 1,
convolution_param.stride_size() != 0 ? convolution_param.stride(0) : 1,
convolution_param.pad_size() != 0 ? convolution_param.pad(0) : 0,
convolution_param.bias_term(),
weight_blob.data_size());
for (int j = 0; j < binlayer.blobs_size(); j++)
{
int quantize_tag = 0;
const caffe::BlobProto& blob = binlayer.blobs(j);
std::vector<float> quantize_table;
std::vector<unsigned char> quantize_index;
std::vector<unsigned short> float16_weights;
// we will not quantize the bias values
if (j == 0 && quantize_level != 0)
{
if (quantize_level == 256)
{
quantize_tag = quantize_weight((float *)blob.data().data(), blob.data_size(), quantize_level, quantize_table, quantize_index);
}
else if (quantize_level == 65536)
{
quantize_tag = quantize_weight((float *)blob.data().data(), blob.data_size(), float16_weights);
}
}
// write quantize tag first
if (j == 0)
fwrite(&quantize_tag, sizeof(int), 1, bp);
if (quantize_tag)
{
int p0 = ftell(bp);
if (quantize_level == 256)
{
// write quantize table and index
fwrite(quantize_table.data(), sizeof(float), quantize_table.size(), bp);
fwrite(quantize_index.data(), sizeof(unsigned char), quantize_index.size(), bp);
}
else if (quantize_level == 65536)
{
fwrite(float16_weights.data(), sizeof(unsigned short), float16_weights.size(), bp);
}
// padding to 32bit align
int nwrite = ftell(bp) - p0;
int nalign = alignSize(nwrite, 4);
unsigned char padding[4] = {0x00, 0x00, 0x00, 0x00};
fwrite(padding, sizeof(unsigned char), nalign - nwrite, bp);
}
else
{
// write original data
fwrite(blob.data().data(), sizeof(float), blob.data_size(), bp);
}
}
}
else if (layer.type() == "Crop")
{
const caffe::CropParameter& crop_param = layer.crop_param();
int num_offset = crop_param.offset_size();
int woffset = (num_offset == 2) ? crop_param.offset(0) : 0;
int hoffset = (num_offset == 2) ? crop_param.offset(1) : 0;
fprintf(pp, " %d %d", woffset, hoffset);
}
else if (layer.type() == "Deconvolution")
{
const caffe::LayerParameter& binlayer = net.layer(netidx);
const caffe::BlobProto& weight_blob = binlayer.blobs(0);
const caffe::ConvolutionParameter& convolution_param = layer.convolution_param();
fprintf(pp, " %d %d %d %d %d %d %d", convolution_param.num_output(), convolution_param.kernel_size(0),
convolution_param.dilation_size() != 0 ? convolution_param.dilation(0) : 1,
convolution_param.stride_size() != 0 ? convolution_param.stride(0) : 1,
convolution_param.pad_size() != 0 ? convolution_param.pad(0) : 0,
convolution_param.bias_term(),
weight_blob.data_size());
int quantized_weight = 0;
fwrite(&quantized_weight, sizeof(int), 1, bp);
// reorder weight from inch-outch to outch-inch
int ksize = convolution_param.kernel_size(0);
int num_output = convolution_param.num_output();
int num_input = weight_blob.data_size() / (ksize * ksize) / num_output;
const float* weight_data_ptr = weight_blob.data().data();
for (int k=0; k<num_output; k++)
{
for (int j=0; j<num_input; j++)
{
fwrite(weight_data_ptr + (j*num_output + k) * ksize * ksize, sizeof(float), ksize * ksize, bp);
}
}
for (int j=1; j<binlayer.blobs_size(); j++)
{
const caffe::BlobProto& blob = binlayer.blobs(j);
fwrite(blob.data().data(), sizeof(float), blob.data_size(), bp);
}
}
else if (layer.type() == "Eltwise")
{
const caffe::EltwiseParameter& eltwise_param = layer.eltwise_param();
int coeff_size = eltwise_param.coeff_size();
fprintf(pp, " %d %d", (int)eltwise_param.operation(), coeff_size);
for (int j=0; j<coeff_size; j++)
{
fprintf(pp, " %f", eltwise_param.coeff(j));
}
}
else if (layer.type() == "InnerProduct")
{
const caffe::LayerParameter& binlayer = net.layer(netidx);
const caffe::BlobProto& weight_blob = binlayer.blobs(0);
const caffe::InnerProductParameter& inner_product_param = layer.inner_product_param();
fprintf(pp, " %d %d %d", inner_product_param.num_output(), inner_product_param.bias_term(),
weight_blob.data_size());
for (int j=0; j<binlayer.blobs_size(); j++)
{
int quantize_tag = 0;
const caffe::BlobProto& blob = binlayer.blobs(j);
std::vector<float> quantize_table;
std::vector<unsigned char> quantize_index;
std::vector<unsigned short> float16_weights;
// we will not quantize the bias values
if (j == 0 && quantize_level != 0)
{
if (quantize_level == 256)
{
quantize_tag = quantize_weight((float *)blob.data().data(), blob.data_size(), quantize_level, quantize_table, quantize_index);
}
else if (quantize_level == 65536)
{
quantize_tag = quantize_weight((float *)blob.data().data(), blob.data_size(), float16_weights);
}
}
// write quantize tag first
if (j == 0)
fwrite(&quantize_tag, sizeof(int), 1, bp);
if (quantize_tag)
{
int p0 = ftell(bp);
if (quantize_level == 256)
{
// write quantize table and index
fwrite(quantize_table.data(), sizeof(float), quantize_table.size(), bp);
fwrite(quantize_index.data(), sizeof(unsigned char), quantize_index.size(), bp);
}
else if (quantize_level == 65536)
{
fwrite(float16_weights.data(), sizeof(unsigned short), float16_weights.size(), bp);
}
// padding to 32bit align
int nwrite = ftell(bp) - p0;
int nalign = alignSize(nwrite, 4);
unsigned char padding[4] = {0x00, 0x00, 0x00, 0x00};
fwrite(padding, sizeof(unsigned char), nalign - nwrite, bp);
}
else
{
// write original data
fwrite(blob.data().data(), sizeof(float), blob.data_size(), bp);
}
}
}
else if (layer.type() == "Input")
{
const caffe::InputParameter& input_param = layer.input_param();
const caffe::BlobShape& bs = input_param.shape(0);
for (int j=1; j<std::min((int)bs.dim_size(), 4); j++)
{
fprintf(pp, " %lld", bs.dim(j));
}
for (int j=bs.dim_size(); j<4; j++)
{
fprintf(pp, " -233");
}
}
else if (layer.type() == "LRN")
{
const caffe::LRNParameter& lrn_param = layer.lrn_param();
fprintf(pp, " %d %d %.8f %.8f", lrn_param.norm_region(), lrn_param.local_size(), lrn_param.alpha(), lrn_param.beta());
}
else if (layer.type() == "MemoryData")
{
const caffe::MemoryDataParameter& memory_data_param = layer.memory_data_param();
fprintf(pp, " %d %d %d", memory_data_param.channels(), memory_data_param.width(), memory_data_param.height());
}
else if (layer.type() == "Pooling")
{
const caffe::PoolingParameter& pooling_param = layer.pooling_param();
fprintf(pp, " %d %d %d %d %d", pooling_param.pool(), pooling_param.kernel_size(), pooling_param.stride(), pooling_param.pad(),
pooling_param.has_global_pooling() ? pooling_param.global_pooling() : 0);
}
else if (layer.type() == "Power")
{
const caffe::PowerParameter& power_param = layer.power_param();
fprintf(pp, " %f %f %f", power_param.power(), power_param.scale(), power_param.shift());
}
else if (layer.type() == "PReLU")
{
const caffe::LayerParameter& binlayer = net.layer(netidx);
const caffe::BlobProto& slope_blob = binlayer.blobs(0);
fprintf(pp, " %d", slope_blob.data_size());
fwrite(slope_blob.data().data(), sizeof(float), slope_blob.data_size(), bp);
}
else if (layer.type() == "Proposal")
{
const caffe::PythonParameter& python_param = layer.python_param();
int feat_stride = 16;
sscanf(python_param.param_str().c_str(), "'feat_stride': %d", &feat_stride);
int base_size = 16;
// float ratio;
// float scale;
int pre_nms_topN = 6000;
int after_nms_topN = 5;
float nms_thresh = 0.7;
int min_size = 16;
fprintf(pp, " %d %d %d %d %f %d", feat_stride, base_size, pre_nms_topN, after_nms_topN, nms_thresh, min_size);
}
else if (layer.type() == "ReLU")
{
const caffe::ReLUParameter& relu_param = layer.relu_param();
fprintf(pp, " %f", relu_param.negative_slope());
}
else if (layer.type() == "Reshape")
{
const caffe::ReshapeParameter& reshape_param = layer.reshape_param();
const caffe::BlobShape& bs = reshape_param.shape();
for (int j=1; j<std::min((int)bs.dim_size(), 4); j++)
{
fprintf(pp, " %lld", bs.dim(j));
}
for (int j=bs.dim_size(); j<4; j++)
{
fprintf(pp, " -233");
}
}
else if (layer.type() == "ROIPooling")
{
const caffe::ROIPoolingParameter& roi_pooling_param = layer.roi_pooling_param();
fprintf(pp, " %d %d %.8f", roi_pooling_param.pooled_w(), roi_pooling_param.pooled_h(), roi_pooling_param.spatial_scale());
}
else if (layer.type() == "Scale")
{
const caffe::LayerParameter& binlayer = net.layer(netidx);
const caffe::BlobProto& weight_blob = binlayer.blobs(0);
const caffe::ScaleParameter& scale_param = layer.scale_param();
fprintf(pp, " %d %d", (int)weight_blob.data_size(), scale_param.bias_term());
for (int j=0; j<binlayer.blobs_size(); j++)
{
const caffe::BlobProto& blob = binlayer.blobs(j);
fwrite(blob.data().data(), sizeof(float), blob.data_size(), bp);
}
}
else if (layer.type() == "Slice")
{
const caffe::SliceParameter& slice_param = layer.slice_param();
if (slice_param.has_slice_dim())
{
int num_slice = layer.top_size();
fprintf(pp, " %d", num_slice);
for (int j=0; j<num_slice; j++)
{
fprintf(pp, " -233");
}
}
else
{
int num_slice = slice_param.slice_point_size() + 1;
fprintf(pp, " %d", num_slice);
int prev_offset = 0;
for (int j=0; j<num_slice; j++)
{
int offset = slice_param.slice_point(j);
fprintf(pp, " %d", offset - prev_offset);
prev_offset = offset;
}
fprintf(pp, " -233");
}
}
else if (layer.type() == "Threshold")
{
const caffe::ThresholdParameter& threshold_param = layer.threshold_param();
fprintf(pp, " %f", threshold_param.threshold());
}
fprintf(pp, "\n");
// add split layer if top reference larger than one
if (layer.bottom_size() == 1 && layer.top_size() == 1 && layer.bottom(0) == layer.top(0))
{
std::string blob_name = blob_name_decorated[layer.top(0)];
if (bottom_reference.find(blob_name) != bottom_reference.end())
{
int refcount = bottom_reference[blob_name];
if (refcount > 1)
{
char splitname[256];
sprintf(splitname, "splitncnn_%d", internal_split);
fprintf(pp, "%-16s %-16s %d %d", "Split", splitname, 1, refcount);
fprintf(pp, " %s", blob_name.c_str());
for (int j=0; j<refcount; j++)
{
fprintf(pp, " %s_splitncnn_%d", blob_name.c_str(), j);
}
fprintf(pp, "\n");
internal_split++;
}
}
}
else
{
for (int j=0; j<layer.top_size(); j++)
{
std::string blob_name = layer.top(j);
if (bottom_reference.find(blob_name) != bottom_reference.end())
{
int refcount = bottom_reference[blob_name];
if (refcount > 1)
{
char splitname[256];
sprintf(splitname, "splitncnn_%d", internal_split);
fprintf(pp, "%-16s %-16s %d %d", "Split", splitname, 1, refcount);
fprintf(pp, " %s", blob_name.c_str());
for (int j=0; j<refcount; j++)
{
fprintf(pp, " %s_splitncnn_%d", blob_name.c_str(), j);
}
fprintf(pp, "\n");
internal_split++;
}
}
}
}
}
fclose(pp);
fclose(bp);
return 0;
}
| [
"[email protected]"
] | |
457ac81b2f53dc5f3dd38774e432d5f86fa4ce4d | aa803dab12247d693cddb8e2ba1b61f807547fe9 | /build-SMail-Desktop_Qt_5_4_1_MSVC2013_64bit-Debug/ui_mainwindow.h | b57400ec4fc348c1f9684832be58bb9b44ad20ca | [] | no_license | Luqaz/SPOVM | 1a767ccc6f8e5c996deb4b4beb99eefa266395a2 | 5fa5d18a6250c7ee7a0b8b3bed6ecbad32cf469a | refs/heads/master | 2020-12-25T19:26:09.156788 | 2015-05-31T16:39:18 | 2015-05-31T16:39:18 | 30,823,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,211 | h | /********************************************************************************
** Form generated from reading UI file 'mainwindow.ui'
**
** Created by: Qt User Interface Compiler version 5.4.1
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
********************************************************************************/
#ifndef UI_MAINWINDOW_H
#define UI_MAINWINDOW_H
#include <QtCore/QVariant>
#include <QtWidgets/QAction>
#include <QtWidgets/QApplication>
#include <QtWidgets/QButtonGroup>
#include <QtWidgets/QHeaderView>
#include <QtWidgets/QListWidget>
#include <QtWidgets/QMainWindow>
#include <QtWidgets/QPushButton>
#include <QtWidgets/QWidget>
QT_BEGIN_NAMESPACE
class Ui_MainWindow
{
public:
QWidget *centralWidget;
QListWidget *AccountList;
QListWidget *MessageList;
QPushButton *sendButton;
QPushButton *addAccountButton;
QPushButton *deleteButton;
void setupUi(QMainWindow *MainWindow)
{
if (MainWindow->objectName().isEmpty())
MainWindow->setObjectName(QStringLiteral("MainWindow"));
MainWindow->resize(813, 493);
MainWindow->setMinimumSize(QSize(813, 493));
MainWindow->setMaximumSize(QSize(813, 493));
centralWidget = new QWidget(MainWindow);
centralWidget->setObjectName(QStringLiteral("centralWidget"));
centralWidget->setStyleSheet(QStringLiteral("background-color: rgb(255, 255, 255)"));
AccountList = new QListWidget(centralWidget);
AccountList->setObjectName(QStringLiteral("AccountList"));
AccountList->setGeometry(QRect(10, 100, 256, 351));
AccountList->setResizeMode(QListView::Adjust);
MessageList = new QListWidget(centralWidget);
MessageList->setObjectName(QStringLiteral("MessageList"));
MessageList->setGeometry(QRect(270, 100, 521, 351));
MessageList->setResizeMode(QListView::Adjust);
sendButton = new QPushButton(centralWidget);
sendButton->setObjectName(QStringLiteral("sendButton"));
sendButton->setGeometry(QRect(714, 460, 81, 23));
addAccountButton = new QPushButton(centralWidget);
addAccountButton->setObjectName(QStringLiteral("addAccountButton"));
addAccountButton->setGeometry(QRect(110, 460, 75, 23));
deleteButton = new QPushButton(centralWidget);
deleteButton->setObjectName(QStringLiteral("deleteButton"));
deleteButton->setGeometry(QRect(190, 460, 75, 23));
MainWindow->setCentralWidget(centralWidget);
retranslateUi(MainWindow);
QMetaObject::connectSlotsByName(MainWindow);
} // setupUi
void retranslateUi(QMainWindow *MainWindow)
{
MainWindow->setWindowTitle(QApplication::translate("MainWindow", "MainWindow", 0));
sendButton->setText(QApplication::translate("MainWindow", "Send Message", 0));
addAccountButton->setText(QApplication::translate("MainWindow", "Add Account", 0));
deleteButton->setText(QApplication::translate("MainWindow", "Delete", 0));
} // retranslateUi
};
namespace Ui {
class MainWindow: public Ui_MainWindow {};
} // namespace Ui
QT_END_NAMESPACE
#endif // UI_MAINWINDOW_H
| [
"[email protected]"
] | |
2e7d2144d4a8365ee58e6b203563b4089467d6ae | d0c44dd3da2ef8c0ff835982a437946cbf4d2940 | /cmake-build-debug/programs_tiling/function14539/function14539_schedule_15/function14539_schedule_15.cpp | 34f3a0086c48f3256198d482c3c0cea85fb84035 | [] | no_license | IsraMekki/tiramisu_code_generator | 8b3f1d63cff62ba9f5242c019058d5a3119184a3 | 5a259d8e244af452e5301126683fa4320c2047a3 | refs/heads/master | 2020-04-29T17:27:57.987172 | 2019-04-23T16:50:32 | 2019-04-23T16:50:32 | 176,297,755 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,781 | cpp | #include <tiramisu/tiramisu.h>
using namespace tiramisu;
int main(int argc, char **argv){
tiramisu::init("function14539_schedule_15");
constant c0("c0", 256), c1("c1", 128), c2("c2", 2048);
var i0("i0", 0, c0), i1("i1", 0, c1), i2("i2", 0, c2), i01("i01"), i02("i02"), i03("i03"), i04("i04");
input input00("input00", {i1}, p_int32);
input input01("input01", {i1, i2}, p_int32);
input input02("input02", {i0}, p_int32);
input input03("input03", {i1, i2}, p_int32);
input input04("input04", {i0, i1}, p_int32);
input input05("input05", {i1, i2}, p_int32);
input input06("input06", {i0}, p_int32);
computation comp0("comp0", {i0, i1, i2}, input00(i1) + input01(i1, i2) - input02(i0) - input03(i1, i2) + input04(i0, i1) - input05(i1, i2) + input06(i0));
comp0.tile(i1, i2, 128, 64, i01, i02, i03, i04);
comp0.parallelize(i0);
buffer buf00("buf00", {128}, p_int32, a_input);
buffer buf01("buf01", {128, 2048}, p_int32, a_input);
buffer buf02("buf02", {256}, p_int32, a_input);
buffer buf03("buf03", {128, 2048}, p_int32, a_input);
buffer buf04("buf04", {256, 128}, p_int32, a_input);
buffer buf05("buf05", {128, 2048}, p_int32, a_input);
buffer buf06("buf06", {256}, p_int32, a_input);
buffer buf0("buf0", {256, 128, 2048}, p_int32, a_output);
input00.store_in(&buf00);
input01.store_in(&buf01);
input02.store_in(&buf02);
input03.store_in(&buf03);
input04.store_in(&buf04);
input05.store_in(&buf05);
input06.store_in(&buf06);
comp0.store_in(&buf0);
tiramisu::codegen({&buf00, &buf01, &buf02, &buf03, &buf04, &buf05, &buf06, &buf0}, "../data/programs/function14539/function14539_schedule_15/function14539_schedule_15.o");
return 0;
} | [
"[email protected]"
] | |
f523f810a34c707f69f06a32a7b6c4cdaab6631b | c22d65113ebf726c89fdc8da2a7e5e3552478014 | /src/libraries/Bounce2/Bounce2.h | e9fe87cdbe180c07125b284b793ac10d5ba37123 | [] | no_license | d-diot/mainmcu | 4b1795607223a65b7f956916912994e87188a9b4 | fc2175f937a0f086eb50ddf2b26ac53298460cf4 | refs/heads/master | 2023-02-27T12:43:55.095736 | 2021-01-29T20:54:52 | 2021-01-29T20:54:52 | 268,135,663 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,300 | h | /*
The MIT License (MIT)
Copyright (c) 2013 thomasfredericks
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.
*/
/* * * * * * * * * * * * * * * * * * * * * * * * * * * *
Main code by Thomas O Fredericks ([email protected])
Previous contributions by Eric Lowry, Jim Schimpf and Tom Harkaway
* * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/**
* @todo Make Bounce2 more abstract. Split it from the hardware layer.
* @body Remove deboucing code from Bounce2 and make a new Debounce class from that code. Bounce2 should extend Debounce.
*/
#ifndef Bounce2_h
#define Bounce2_h
#if defined(ARDUINO) && ARDUINO >= 100
#include "Arduino.h"
#else
#include "WProgram.h"
#endif
// Uncomment the following line for "LOCK-OUT" debounce method
//#define BOUNCE_LOCK_OUT
// Uncomment the following line for "BOUNCE_WITH_PROMPT_DETECTION" debounce method
//#define BOUNCE_WITH_PROMPT_DETECTION
#include <inttypes.h>
/**
@example bounce.ino
Simple example of the Bounce library that switches the debug LED when a button is pressed.
*/
/**
@example change.ino
This example toggles the debug LED (pin 13) on or off when a button on pin 2 is pressed.
*/
/**
@example bounce_multiple.ino
Detect the falling edge of multiple buttons. Eight buttons with internal pullups. Toggles a LED when any button is pressed. Buttons on pins 2,3,4,5,6,7,8,9
*/
/**
@example bounce2buttons.ino
Example of two instances of the Bounce class that switches the debug LED when either one of the two buttons is pressed.
*/
static const uint8_t DEBOUNCED_STATE = 0b00000001;
static const uint8_t UNSTABLE_STATE = 0b00000010;
static const uint8_t CHANGED_STATE = 0b00000100;
/**
The Bounce class.
*/
class Bounce
{
public:
/*!
@brief Create an instance of the Bounce class.
@code
// Create an instance of the Bounce class.
Bounce() button;
@endcode
*/
Bounce();
/*!
@brief Attach to a pin and sets that pin's mode (INPUT, INPUT_PULLUP or OUTPUT).
@param pin
The pin that is to be debounced.
@param mode
A valid Arduino pin mode (INPUT, INPUT_PULLUP or OUTPUT).
*/
void attach(int pin, int mode);
/**
Attach to a pin for advanced users. Only attach the pin this way once you have previously set it up. Otherwise use attach(int pin, int mode).
*/
void attach(int pin);
/**
@brief Sets the debounce interval in milliseconds.
@param interval_millis
The interval time in milliseconds.
*/
void interval(uint16_t interval_millis);
/*!
@brief Updates the pin's state.
Because Bounce does not use interrupts, you have to "update" the object before reading its value and it has to be done as often as possible (that means to include it in your loop()). Only call update() once per loop().
@return True if the pin changed state.
*/
bool update();
/**
@brief Returns the pin's state (HIGH or LOW).
@return HIGH or LOW.
*/
bool read();
/**
@brief Returns true if pin signal transitions from high to low.
*/
bool fell();
/**
@brief Returns true if pin signal transitions from low to high.
*/
bool rose();
/**
@brief Deprecated (i.e. do not use). Included for partial compatibility for programs written with Bounce version 1
*/
bool risingEdge() { return rose(); }
/**
@brief Deprecated (i.e. do not use). Included for partial compatibility for programs written with Bounce version 1
*/
bool fallingEdge() { return fell(); }
/**
@brief Deprecated (i.e. do not use). Included for partial compatibility for programs written with Bounce version 1
*/
Bounce(uint8_t pin, unsigned long interval_millis) : Bounce()
{
attach(pin);
interval(interval_millis);
}
/**
@brief Returns the duration in milliseconds of the current state.
Is reset to 0 once the pin rises ( rose() ) or falls ( fell() ).
@return The duration in milliseconds (unsigned long) of the current state.
*/
unsigned long duration();
/**
@brief Returns the duration in milliseconds of the previous state.
Takes the values of duration() once the pin changes state.
@return The duration in milliseconds (unsigned long) of the previous state.
*/
unsigned long previousDuration();
protected:
unsigned long previous_millis;
uint16_t interval_millis;
uint8_t state;
uint8_t pin;
unsigned long stateChangeLastTime;
unsigned long durationOfPreviousState;
virtual bool readCurrentState() { return digitalRead(pin); }
virtual void setPinMode(int pin, int mode)
{
#if defined(ARDUINO_ARCH_STM32F1)
pinMode(pin, (WiringPinMode)mode);
#else
pinMode(pin, mode);
#endif
}
private:
inline void changeState();
inline void setStateFlag(const uint8_t flag) { state |= flag; }
inline void unsetStateFlag(const uint8_t flag) { state &= ~flag; }
inline void toggleStateFlag(const uint8_t flag) { state ^= flag; }
inline bool getStateFlag(const uint8_t flag) { return ((state & flag) != 0); }
public:
bool changed() { return getStateFlag(CHANGED_STATE); }
};
#endif | [
"[email protected]"
] | |
4fb1a52d748490242e2d2a86623aa59b6c14d186 | c824d97cc1208744e4453bac916dcc24dc77a377 | /libcaf_io/caf/io/network/stream_manager.hpp | c9129d4c56adf1dc5baaba06417ca8b692ab6c9c | [
"BSL-1.0"
] | permissive | DePizzottri/actor-framework | 1a033440660c4ea507b743b0d46a46de7fd30df6 | bdbd19541b1e1e6ec0abe16bcf7db90d73c649d2 | refs/heads/master | 2021-01-24T00:23:18.672012 | 2018-04-28T13:04:21 | 2018-04-28T13:04:21 | 59,172,681 | 0 | 0 | null | 2017-03-07T04:22:26 | 2016-05-19T04:04:18 | C++ | UTF-8 | C++ | false | false | 2,414 | hpp | /******************************************************************************
* ____ _ _____ *
* / ___| / \ | ___| C++ *
* | | / _ \ | |_ Actor *
* | |___ / ___ \| _| Framework *
* \____/_/ \_|_| *
* *
* Copyright (C) 2011 - 2016 *
* Dominik Charousset <dominik.charousset (at) haw-hamburg.de> *
* *
* Distributed under the terms and conditions of the BSD 3-Clause License or *
* (at your option) under the terms and conditions of the Boost Software *
* License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE. *
* *
* If you did not receive a copy of the license files, see *
* http://opensource.org/licenses/BSD-3-Clause and *
* http://www.boost.org/LICENSE_1_0.txt. *
******************************************************************************/
#ifndef CAF_IO_NETWORK_STREAM_MANAGER_HPP
#define CAF_IO_NETWORK_STREAM_MANAGER_HPP
#include <cstddef>
#include "caf/io/network/manager.hpp"
namespace caf {
namespace io {
namespace network {
/// A stream manager configures an IO stream and provides callbacks
/// for incoming data as well as for error handling.
class stream_manager : public manager {
public:
stream_manager(abstract_broker* ptr);
~stream_manager() override;
/// Called by the underlying I/O device whenever it received data.
/// @returns `true` if the manager accepts further reads, otherwise `false`.
virtual bool consume(execution_unit* ctx, const void* buf, size_t bsize) = 0;
/// Called by the underlying I/O device whenever it sent data.
virtual void data_transferred(execution_unit* ctx, size_t num_bytes,
size_t remaining_bytes) = 0;
};
} // namespace network
} // namespace io
} // namespace caf
#endif // CAF_IO_NETWORK_STREAM_MANAGER_HPP
| [
"[email protected]"
] | |
842dcfb3f6758d88873d60a66f6007e37cdcf6ce | 8eac6a6d838ceb06c44daa28bb9ef7aaccddbf9b | /Chapter11/ch11ex2/DLHashTable.h | 478bd21802e614e5802ba0f13415dc735bc91a96 | [] | no_license | Song621/CPP-Classes-and-Data-Structures | e66def3fca5eb85c2e7503e5d8293879e53250c6 | d9c1ede3c92ab123a600a18ae03f124e41ba3c6f | refs/heads/master | 2023-08-30T12:56:06.279988 | 2021-11-10T16:53:46 | 2021-11-10T16:53:46 | 303,077,699 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,484 | h | #pragma once
#include "Array.h"
#include "CollisionList.h"
template <class DataType>
class DLHashTable
{
public:
DLHashTable(int (*hf)(const DataType&), int s);
bool insert(const DataType& newObject);
bool retrieve(DataType& retrieved);
bool remove(DataType& removed);
bool update(DataType& updateObject);
void makeEmpty();
Node<DataType>* getcurrent();
int (*gethashfunc() const)(const DataType&);
void sethashfunc(int (*hf)(const DataType&));
int getsize() const;
void changeSize(int newSize);
private:
Array<CollisionList<DataType> > table;
int (*hashfunc)(const DataType&);
int location;
};
template <class DataType>
DLHashTable<DataType>::DLHashTable(int(*hf)(const DataType&), int s)
:table(s)
{
hashfunc = hf;
}
template <class DataType>
bool DLHashTable<DataType>::insert(const DataType& newObject)
{
location = hashfunc(newObject);
if (location < 0 || location > table.length())
return false;
table[location].insert(newObject);
return true;
}
template <class DataType>
bool DLHashTable<DataType>::retrieve(DataType& retrieved)
{
location = hashfunc(retrieved);
if (location < 0 || location > table.length())
return false;
if (!table[location].retrieve(retrieved))
return false;
return true;
}
template <class DataType>
bool DLHashTable<DataType>::remove(DataType& removed)
{
location = hashfunc(removed);
if (location < 0 || location > table.length())
return false;
if (!table[location].remove(removed))
return false;
return true;
}
template <class DataType>
bool DLHashTable<DataType>::update(DataType& updateObject)
{
location = hashfunc(updateObject);
if (location < 0 || location > table.length())
return false;
if (!table[location].find(updateObject))
return false;
table[location].replace(updateObject);
return true;
}
template <class DataType>
void DLHashTable<DataType>::makeEmpty()
{
for (int i = 0; i < table.length(); i++)
table[i].makeEmpty();
}
template <class DataType>
Node<DataType>* DLHashTable<DataType>::getcurrent()
{
return table[location].getcurrent();
}
template <class DataType>
int (*DLHashTable<DataType>::gethashfunc() const)(const DataType&)
{
return hashfunc;
}
template <class DataType>
void DLHashTable<DataType>::sethashfunc(int (*hf)(const DataType&))
{
hashfunc = hf;
}
template <class DataType>
int DLHashTable<DataType>::getsize() const
{
return table.length();
}
template <class DataType>
void DLHashTable<DataType>::changeSize(int newSize)
{
table.changeSize(newSize);
} | [
"[email protected]"
] | |
75a303642f8bc683a5bbe664f60b731685865ac4 | f0779717341f2c471191a94250f5b83ab3dc20cc | /OpenCV3/CPP-TCP-Client/CPP-TCP-Client/main.cpp | 52ac2624257c173696723642a11704b9222d22cd | [] | no_license | IceArmour/ZSC-2017-ETHEIH | c6de0e143dcf683d436c0dd653423743769ba9d9 | f85f0a64c7b2521bfc8e6a6d58c88980f0027e05 | refs/heads/master | 2020-03-27T08:34:03.460285 | 2018-08-12T23:15:10 | 2018-08-12T23:15:10 | 131,006,600 | 0 | 0 | null | 2018-04-25T12:57:53 | 2018-04-25T12:57:53 | null | UTF-8 | C++ | false | false | 1,343 | cpp | //--------------------------------------【程序说明】-------------------------------------------
// 程序说明：第11次汇报 CPP-TCP-Client
// 程序描述：建立TCP通信协议，作为客户端与VISOR进行通信
// 开发测试所用操作系统：Windows 10 64bit
// 开发测试所用IDE版本：Visual Studio 2017
// 2018年8月9日 Created by @ZHWKnight
// 2018年4月13日 Revised by @ZHWKnight
//---------------------------------------------------------------------------------------------
#define _WINSOCK_DEPRECATED_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <WinSock2.h>
#include <conio.h>
#pragma comment(lib, "ws2_32.lib")
int main() {
WSADATA wsaData;
WSAStartup(MAKEWORD(2, 2), &wsaData);
SOCKET sock = socket(PF_INET, SOCK_STREAM, IPPROTO_TCP);
sockaddr_in sockAddr;
memset(&sockAddr, 0, sizeof(sockAddr));
sockAddr.sin_family = PF_INET;
sockAddr.sin_addr.s_addr = inet_addr("192.168.100.100");
sockAddr.sin_port = htons(2005);
connect(sock, (SOCKADDR*)&sockAddr, sizeof(SOCKADDR));
char szBuffer[MAXBYTE] = { 0 };
int flag = 1;
char unch;
while (flag){
if (_kbhit() && (unch = _getch()) == 0x1b)
flag = 0;
recv(sock, szBuffer, MAXBYTE, NULL);
printf("Coordinate form VISOR: %s\n", szBuffer);
}
closesocket(sock);
WSACleanup();
system("pause");
return 0;
} | [
"[email protected]"
] | |
6ace4346789645c05334fadbcae6ddcd85808d28 | 1d928c3f90d4a0a9a3919a804597aa0a4aab19a3 | /c++/Chaste/2016/8/AbstractAcinarUnitFactory.cpp | 1d66673254aedfa5d9313fe09f668d4ff2f7e6f7 | [] | no_license | rosoareslv/SED99 | d8b2ff5811e7f0ffc59be066a5a0349a92cbb845 | a062c118f12b93172e31e8ca115ce3f871b64461 | refs/heads/main | 2023-02-22T21:59:02.703005 | 2021-01-28T19:40:51 | 2021-01-28T19:40:51 | 306,497,459 | 1 | 1 | null | 2020-11-24T20:56:18 | 2020-10-23T01:18:07 | null | UTF-8 | C++ | false | false | 2,664 | cpp | /*
Copyright (c) 2005-2016, University of Oxford.
All rights reserved.
University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.
This file is part of Chaste.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the University of Oxford nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "AbstractAcinarUnitFactory.hpp"
#include "AbstractAcinarUnit.hpp"
//void AbstractAcinarUnitFactory::FinaliseAcinarUnitCreation(
// std::vector< AbstractAcinarUnit* >* pAcinarUnitsDistributed,
// unsigned lo,
// unsigned hi)
//{
//}
unsigned AbstractAcinarUnitFactory::GetNumberOfAcini()
{
assert(mpMesh != NULL);
return mpMesh->GetNumBoundaryNodes();
}
AbstractAcinarUnitFactory::AbstractAcinarUnitFactory()
: mpMesh(NULL)
{
}
AbstractAcinarUnitFactory::~AbstractAcinarUnitFactory()
{
}
void AbstractAcinarUnitFactory::SetMesh(AbstractTetrahedralMesh<1,3>* pMesh)
{
mpMesh = pMesh;
}
AbstractTetrahedralMesh<1,3>* AbstractAcinarUnitFactory::GetMesh()
{
if (mpMesh == NULL)
{
EXCEPTION("The mesh object has not been set in the acinar unit factory");
}
return mpMesh;
}
double AbstractAcinarUnitFactory::GetPleuralPressureForNode(double time, Node<3>* pNode)
{
return 0.0;
}
| [
"[email protected]"
] | |
068249937238b4474fabad7e5fccb75659d0154f | 9a9297f7760f3e07ce281e7ab0e85dd2e2d607bd | /testbed/tests/es_benchmark_seed1.cpp | 72c6623cb649663494468452fcb1bdaedf1d0205 | [
"MIT"
] | permissive | DomiKoPL/BoxCar2D.cpp | c63d8b6e181a280529b8271928be3423cb362098 | a3bbb80304bccf7a8a232bfb8fe78718c47e03f7 | refs/heads/main | 2023-07-18T17:55:01.032440 | 2021-09-19T16:19:47 | 2021-09-19T16:19:47 | 332,049,853 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,818 | cpp | #include "test.h"
#include <string>
#include "car.h"
#include "chromosome.h"
#include <algorithm>
#include "es_benchmark_seed1.hpp"
#include <iostream>
#include "settings.h"
ESBenchmarkSeed1::ESBenchmarkSeed1()
{
blocked_environment = nullptr;
}
void ESBenchmarkSeed1::Step(Settings& settings)
{
if(blocked_environment == nullptr)
{
blocked_environment = new RandomTrack(true, settings.m_seed);
std::thread thread = std::thread([&]() {
std::vector<Chromosome> cars {
{ { -1.40947,3.33867,0.664098,2.02331,-0.789912,0.283467,-4.22899,2.12154,0.626879,-0.589122,0.134152,-0.689913,1.59957,-4.35033,3.48799,1.48576,-0.525083,1.01047,-0.284946,1.95286,1.63649,-1.3947,-0.455445,1.33717,0.659162,-0.994306,-1.91633,1.28992,1.0544,0.239294,0.799867,1.44854 }
},
{ { -1.34254,2.77852,1.96346,2.03842,1.65576,-0.883999,-0.338317,2.18958,0.293332,-0.254225,-0.786506,-0.393182,1.85326,-2.91368,2.8098,1.63223,-0.456717,1.023,-0.792659,0.602946,1.83317,-0.367612,-0.755923,1.8626,0.816038,-1.68726,-1.36289,-0.0532756,1.21996,0.558007,0.836011,1.10054 }
},
{ { 1.23172,1.58208,-0.961399,-0.152305,-1.40711,-3.52487,1.09184,1.76378,-0.324951,0.169049,-1.87576,0.653553,-0.28068,0.615594,0.833145,-0.145624,-3.71903,0.111686,1.57014,-3.83783,0.524206,0.524062,4.62487,1.12221,1.52598,1.07277,1.49888,-0.035017,-1.45523,-0.0109419,-2.76209,-1.89912 }
},
{ { -1.33449,4.52321,3.70357,2.38846,0.869323,1.91141,-1.7445,1.71181,-0.314244,-0.85919,1.09481,-1.17754,1.64182,-4.92674,4.36379,1.90572,-0.478741,0.943701,-0.713955,3.28116,1.90119,-1.14899,-0.428792,0.658593,0.892251,-0.422259,0.157504,3.1598,1.12963,0.800961,1.14253,2.18033 }
},
{ { -1.30378,2.34645,2.18994,2.13789,0.884323,-0.548365,0.144172,2.2943,0.19159,-0.375857,-0.271666,-0.631576,1.79449,-2.41151,1.99647,1.01554,-0.665393,1.22594,-0.699728,0.471043,1.58099,-0.500927,-0.726044,1.33754,0.835102,-1.86937,-1.22183,0.20355,1.42477,0.483058,0.512687,0.634192 }
},
{ { -1.43756,3.38925,1.0173,1.64294,0.13809,-0.040811,-3.54202,2.0032,0.0620544,-0.728678,0.548828,-0.632022,1.26219,-3.42748,4.28812,1.73712,-0.462246,0.626316,-0.138531,1.88954,1.07689,-2.88091,-0.435965,1.19563,0.606453,-1.21673,-0.839878,1.64032,1.0846,0.510989,0.98712,1.67677 }
},
{ { -1.41744,4.50889,3.75318,2.29442,0.661895,1.84666,-1.61401,1.71009,-0.308054,-1.01155,1.08747,-1.24392,1.6422,-4.78829,4.43294,1.84818,-0.512208,0.860169,-0.791697,2.7212,1.83621,-1.00646,-0.415109,0.564517,0.933403,-0.820743,0.203932,3.0868,1.17521,0.735135,1.06031,2.13286 }
},
{ { -1.37214,4.52271,3.70869,2.34204,0.687904,1.78425,-1.70695,1.71542,-0.362855,-0.96981,1.0412,-1.15131,1.64155,-4.89169,4.37931,1.83937,-0.521984,0.931047,-0.739075,2.55367,1.81743,-0.964664,-0.400725,0.56436,0.936157,-0.771741,0.194409,2.97013,1.17858,0.741626,0.96941,2.19455 }
},
{ { -1.49759,4.54648,3.51147,2.26144,0.682383,1.87732,-1.59002,1.7761,-0.371096,-0.989877,1.03663,-1.25319,1.647,-4.89054,4.31493,1.84011,-0.49996,0.970815,-0.832744,2.81708,1.79991,-1.0513,-0.3598,0.481395,0.9712,-0.8289,0.228946,3.10124,1.26156,0.690572,0.935311,2.38694 }
},
{ { -1.43114,4.36324,2.70527,2.3671,0.174668,1.75029,-1.0647,1.71338,-0.350738,-0.964126,0.842392,-1.46709,1.41576,-4.87003,4.31087,1.81047,-0.494689,1.10429,-0.561041,1.54623,1.37849,-1.97408,-0.227956,1.08225,0.902863,-1.79199,0.497882,2.76964,1.08581,0.689272,0.846057,1.79219 }
},
{ { -1.33592,4.54784,4.09841,2.26524,0.767178,1.88075,-1.69909,1.7108,-0.294582,-0.82303,1.01267,-1.31828,1.65878,-4.94432,4.2381,1.8548,-0.485002,0.91752,-0.785439,3.11954,1.58105,-1.02237,-0.378105,0.692392,0.882718,-0.643044,0.149163,3.0576,1.12836,0.74157,1.08909,2.02294 }
},
{ { 0.937432,1.96636,-0.519319,-1.90381,-2.36196,-2.64511,1.89112,0.716304,-1.69896,0.660922,0.436538,0.765552,-0.49171,0.815552,-0.427242,-0.442689,-3.37428,-0.0676926,2.47249,-2.76556,0.263268,0.71827,1.36828,1.40123,0.920297,0.579379,-0.95027,-0.374426,-0.281251,-0.444428,-2.39069,-1.83128 }
},
{ { -1.30469,3.95314,2.70595,1.75433,0.474738,0.346495,-2.27369,1.94852,-0.55601,-0.700441,0.434402,-1.09501,1.51878,-3.73293,3.84442,1.71713,-0.419578,1.295,0.171989,2.33946,1.07703,-2.59278,-1.01249,1.14424,0.257702,-1.49717,-0.268213,2.33265,0.951459,0.56554,1.38247,1.31964 }
},
{ { -1.41963,4.558,3.79248,2.24108,0.815926,1.85404,-1.73587,1.7067,-0.279325,-0.983141,1.12811,-1.30359,1.65363,-4.6774,4.44585,1.82454,-0.514717,0.765522,-0.788319,2.75584,1.7246,-0.806544,-0.43143,0.54965,0.924547,-0.739333,0.18057,3.08764,1.20206,0.719546,1.11519,2.153 }
},
{ { -1.38618,4.44349,1.74339,2.45864,0.409986,1.11696,-0.725185,1.85659,-0.209493,-0.865055,0.909353,-1.54459,1.59948,-4.22105,4.35372,1.56981,-0.474918,0.720885,-0.1986,2.30341,1.34587,-2.13707,-0.503546,1.13475,0.54531,-1.58955,-0.181264,2.77132,0.895899,0.6722,1.08879,1.893 }
},
{ { -1.36608,4.3214,2.41065,1.92672,0.184297,0.822457,-2.10329,1.89452,-0.335913,-0.805207,0.643736,-1.37797,1.54727,-3.68823,4.70483,1.59278,-0.463336,1.1248,-0.0639861,2.2594,1.37386,-2.20402,-0.52579,1.31657,0.300825,-1.56485,-0.412459,2.59702,0.656084,0.704501,1.48468,1.25465 }
},
{ { 1.87467,0.904289,2.14339,2.14535,-1.51659,-2.25427,1.35623,1.21725,1.00335,0.273344,1.72307,0.560871,0.0946994,0.818288,-0.38045,-0.0801961,-0.0973398,0.322278,0.157355,-1.14501,0.592204,0.846485,2.4908,-0.663649,0.63747,1.16597,-0.579264,-0.329395,-1.15796,0.384267,0.175672,-1.75494 }
},
{ { -1.07666,3.78694,2.64716,1.75735,0.583805,0.97719,-3.00076,1.9646,-0.445927,-0.63162,0.691023,-0.918021,1.41187,-3.82889,4.28506,1.95643,-0.400429,1.37784,0.162588,2.896,1.14332,-2.40647,-0.852183,1.47837,0.283821,-1.12163,-0.894204,2.29912,0.906513,0.476436,0.634039,1.63864 }
},
{ { -1.29972,4.29134,2.96153,2.42467,0.289999,2.19114,-0.945401,1.71221,-0.314254,-0.974468,1.37098,-1.3684,1.49147,-4.81778,4.55875,1.98266,-0.482395,0.963373,-0.299534,1.2481,1.10415,-2.27053,-0.0455034,1.26344,0.987298,-1.82346,0.301039,2.74774,1.16861,0.700813,0.533816,1.62654 }
},
{ { 0.658946,-1.21168,1.55544,0.663537,0.388918,-0.25622,-0.310598,-0.961685,-0.103866,-1.24084,0.207724,0.206308,1.01709,0.28535,1.21121,-1.49031,-1.57569,1.70159,1.55393,1.68224,0.907241,2.17003,-0.145682,-0.31769,0.776039,0.663055,0.0217179,0.659355,-1.70149,0.249843,0.530629,-1.1227 }
},
{ { -1.37258,4.56223,3.56002,2.19814,0.821358,1.86209,-1.65025,1.71536,-0.34039,-1.0161,1.16846,-1.31563,1.63832,-4.8073,4.42607,1.82074,-0.508304,0.916846,-0.798894,2.80683,1.74971,-0.795976,-0.407574,0.522102,0.902625,-0.936325,0.21313,3.07353,1.17071,0.751045,0.994316,1.92703 }
},
{ { -1.43043,4.25001,2.90742,2.17694,0.219476,1.1299,-1.5283,1.86125,0.0567535,-0.914998,0.674694,-1.42118,1.56667,-4.27233,4.41315,1.59633,-0.495893,1.20995,-0.171834,2.30459,1.08771,-1.89625,-0.593917,1.37214,0.502426,-1.58983,-0.196384,2.53035,0.566426,0.725079,1.19614,1.77091 }
},
{ { -2.00146,2.6398,1.62541,2.35822,-0.0500478,-0.0405515,-6.02312,2.14669,1.2231,-0.723178,-0.197425,-0.628557,1.56984,-4.29407,4.68041,1.91457,-0.559551,0.773586,0.154436,1.41542,2.06792,0.0293531,-1.14722,1.99406,0.855385,-1.33799,-1.23796,1.30364,0.539369,0.336999,1.26647,1.73132 }
}
};
blocked_environment->evaluate_function(cars);
});
pthread = thread.native_handle();
thread.detach();
}
blocked_environment->Lock();
blocked_environment->Step(settings);
blocked_environment->DeleteCars();
blocked_environment->Unlock();
}
Test* ESBenchmarkSeed1::Create()
{
return new ESBenchmarkSeed1;
}
ESBenchmarkSeed1::~ESBenchmarkSeed1() {
pthread_cancel(pthread);
delete blocked_environment;
blocked_environment = nullptr;
}
static int testIndex = RegisterTest("BEST CARS", "ES SEED 1", ESBenchmarkSeed1::Create); | [
"[email protected]"
] | |
ffb2fcdbae14fb0cd8739ebd2217472f2ebafa7d | 8d39f509abf62a0947f3e9dd11a1bc02665b609e | /comp2012h/csd_only/lecture/7-class/Emp_codes/static.cpp | 2293bea9c145f7f09d3baa86145bde7afd230ab3 | [] | no_license | clcheungac/clcheungac.github.io | c77c8a0c5b2261cf37602ce644c143e266184277 | 815885f2af89ef3ac32fad607786c6e8fa47c6e0 | refs/heads/master | 2021-01-10T13:08:37.959427 | 2018-12-30T13:44:20 | 2018-12-30T13:44:20 | 48,602,655 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,608 | cpp | // Fig. 10.23: fig10_23.cpp
// static data member tracking the number of objects of a class.
#include <iostream>
using std::cout;
using std::endl;
#include "SEmployee.h" // Employee class definition
int main()
{
// use class name and binary scope resolution operator to
// access static number function getCount
cout << "Number of employees before instantiation of any objects is "
<< Employee::getCount() << endl; // use class name
// use new to dynamically create two new Employees
// operator new also calls the object's constructor
Employee *e1Ptr = new Employee( "Susan", "Baker" );
Employee *e2Ptr = new Employee( "Robert", "Jones" );
// call getCount on first Employee object
cout << "Number of employees after objects are instantiated is "
<< e1Ptr->getCount() << " (same as calling Employee::getCount() = " << Employee::getCount() <<")";
cout << "\n\nEmployee 1: "
<< e1Ptr->getFirstName() << " " << e1Ptr->getLastName()
<< "\nEmployee 2: "
<< e2Ptr->getFirstName() << " " << e2Ptr->getLastName() << "\n\n";
delete e1Ptr; // deallocate memory
e1Ptr = 0; // disconnect pointer from free-store space
delete e2Ptr; // deallocate memory
e2Ptr = 0; // disconnect pointer from free-store space
// no objects exist, so call static member function getCount again
// using the class name and the binary scope resolution operator
cout << "Number of employees after objects are deleted is "
<< Employee::getCount() << endl;
return 0;
} // end main
/**************************************************************************
* (C) Copyright 1992-2008 by Deitel & Associates, Inc. and *
* Pearson Education, Inc. All Rights Reserved. *
* *
* DISCLAIMER: The authors and publisher of this book have used their *
* best efforts in preparing the book. These efforts include the *
* development, research, and testing of the theories and programs *
* to determine their effectiveness. The authors and publisher make *
* no warranty of any kind, expressed or implied, with regard to these *
* programs or to the documentation contained in these books. The authors *
* and publisher shall not be liable in any event for incidental or *
* consequential damages in connection with, or arising out of, the *
* furnishing, performance, or use of these programs. *
**************************************************************************/
| [
"[email protected]"
] | |
31b48c3c2aacaff1842804173f687c81655133ea | 995ec94d7831c13e7025ed59f274def5bce18c39 | /area3.cpp | abb701d2ae5d1f7e508f02988ce1fdf3f9221ada | [] | no_license | srm1071/codingpractice | 71697c5dd011ae560e1473350e57c2c1b3a8e654 | b54a7d915c426a2c030fb256d9989d011ead5aee | refs/heads/master | 2022-10-16T12:59:33.102073 | 2022-10-06T18:39:18 | 2022-10-06T18:39:18 | 137,438,850 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 867 | cpp | #include<iostream>
#include<math.h>
using namespace std;
float area(int,int,int);
float area(int,int);
float area(int);
int main()
{
int a,b,c,r,k;
cout<<"enter your choice"<<endl;
cout<<"1:area of triangle"<<endl;
cout<<"2:area of circle"<<endl;
cout<<"3:area of rectangle"<<endl;
cin>>k;
if(k==1)
{
cout<<"enter sides of triangle";
cin>>a>>b>>c;
cout<<"area of triangle is"<<area(a,b,c)<<endl;
}
else if(k==2)
{ cout<<"enter radius of circle";
cin>>r;
cout<<"area of circle is"<<area(r);
}
else if(k==3)
{ cout<<"enter sides of rectangle";
cin>>a>>b;
cout<<"area of rectangle is"<<area(a,b);
}
else
cout<<"invalid choice";
return 0;
}
float area(int a,int b,int c)
{
float s;
s=(a+b+c)/2;
return (sqrt(s*(s-a)*(s-b)*(s-c)));
}
float area(int a,int b)
{
return a*b;
}
float area(int r)
{
return 3.14*r*r;
}
| [
"[email protected]"
] | |
626698f15d91203e09063693c38b9af803d1bcda | a19c187518fe30e61ed377c4c13376e162b5f0c1 | /utrason_alice_yannick.ino | 8e8c7273516aec7ea928551bfd01fe3fe216bf80 | [] | no_license | ycarissan/utrason_alice_yannick | 1113d39faa86ad152160d5b92502cd6e31df687c | e8764bba5edcacfaba66e1770e7e7f753f8c183a | refs/heads/master | 2022-08-13T11:48:55.653856 | 2020-05-24T09:06:57 | 2020-05-24T09:06:57 | 266,360,665 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,326 | ino | /*
* Ultrasonic Sensor HC-SR04 and Arduino Tutorial
*
* by Dejan Nedelkovski,
* www.HowToMechatronics.com
*
*/
// defines pins numbers
const int trigPin = 2;
const int echoPin = 3;
// defines variables
long duration;
int distance;
void setup() {
pinMode(10, OUTPUT);
pinMode(11, OUTPUT);
pinMode(trigPin, OUTPUT); // Sets the trigPin as an Output
pinMode(echoPin, INPUT); // Sets the echoPin as an Input
Serial.begin(9600); // Starts the serial communication
}
void loop() {
// Clears the trigPin
digitalWrite(trigPin, LOW);
delayMicroseconds(2);
// Sets the trigPin on HIGH state for 10 micro seconds
digitalWrite(trigPin, HIGH);
delayMicroseconds(10);
digitalWrite(trigPin, LOW);
// Reads the echoPin, returns the sound wave travel time in microseconds
duration = pulseIn(echoPin, HIGH);
// Calculating the distance
distance= duration*0.034/2;
// Prints the distance on the Serial Monitor
Serial.print("Distance: ");
Serial.print(distance);
if (distance<7) {
Serial.println("allumer");
allumer_rouge();
eteindre_vert();
} else {
Serial.println("eteindre");
allumer_vert();
eteindre_rouge();
}
}
void allumer_rouge() {
digitalWrite(10, HIGH);
}
void eteindre_rouge() {
digitalWrite(10, LOW);
}
void allumer_vert() {
digitalWrite(11, HIGH);
}
void eteindre_vert() {
digitalWrite(11, LOW);
}
| [
"[email protected]"
] | |
71f6a27c440793cc1ec61f17efa085ba29a7ebf5 | 91e6abe135f8969bfc7aeba30277271590b76ff6 | /cartographer/cartographer/mapping/map_builder.cc | 80eb7fe5c218ef92428d8ffa4e005ff0a6525d3b | [
"Apache-2.0"
] | permissive | eglrp/carto_modify | 2075d186fbd5f802b627a5f50e6e62cbf2f1ad4b | 9d5eb1d1fa511d1ce41222ea7006c416cd513434 | refs/heads/master | 2020-04-07T03:08:25.908720 | 2018-11-14T03:03:39 | 2018-11-14T03:03:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,363 | cc | /*
* Copyright 2016 The Cartographer 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 "cartographer/mapping/map_builder.h"
#include "absl/memory/memory.h"
#include "cartographer/common/time.h"
#include "cartographer/io/internal/mapping_state_serialization.h"
#include "cartographer/io/proto_stream.h"
#include "cartographer/io/proto_stream_deserializer.h"
#include "cartographer/io/serialization_format_migration.h"
#include "cartographer/mapping/internal/2d/local_trajectory_builder_2d.h"
#include "cartographer/mapping/internal/2d/pose_graph_2d.h"
#include "cartographer/mapping/internal/3d/local_trajectory_builder_3d.h"
#include "cartographer/mapping/internal/3d/pose_graph_3d.h"
#include "cartographer/mapping/internal/collated_trajectory_builder.h"
#include "cartographer/mapping/internal/global_trajectory_builder.h"
#include "cartographer/mapping/proto/internal/legacy_serialized_data.pb.h"
#include "cartographer/sensor/internal/collator.h"
#include "cartographer/sensor/internal/trajectory_collator.h"
#include "cartographer/sensor/internal/voxel_filter.h"
#include "cartographer/transform/rigid_transform.h"
#include "cartographer/transform/transform.h"
namespace cartographer {
namespace mapping {
namespace {
using mapping::proto::SerializedData;
std::vector<std::string> SelectRangeSensorIds(
const std::set<MapBuilder::SensorId>& expected_sensor_ids) {
std::vector<std::string> range_sensor_ids;
for (const MapBuilder::SensorId& sensor_id : expected_sensor_ids) {
if (sensor_id.type == MapBuilder::SensorId::SensorType::RANGE) {
range_sensor_ids.push_back(sensor_id.id);
}
}
return range_sensor_ids;
}
void MaybeAddPureLocalizationTrimmer(
const int trajectory_id,
const proto::TrajectoryBuilderOptions& trajectory_options,
PoseGraph* pose_graph) {
if (trajectory_options.pure_localization()) {
LOG(WARNING)
<< "'TrajectoryBuilderOptions::pure_localization' field is deprecated. "
"Use 'TrajectoryBuilderOptions::pure_localization_trimmer' instead.";
pose_graph->AddTrimmer(absl::make_unique<PureLocalizationTrimmer>(
trajectory_id, 3 /* max_submaps_to_keep */));
return;
}
if (trajectory_options.has_pure_localization_trimmer()) {
pose_graph->AddTrimmer(absl::make_unique<PureLocalizationTrimmer>(
trajectory_id,
trajectory_options.pure_localization_trimmer().max_submaps_to_keep()));
}
}
} // namespace
proto::MapBuilderOptions CreateMapBuilderOptions(
common::LuaParameterDictionary* const parameter_dictionary) {
proto::MapBuilderOptions options;
options.set_use_trajectory_builder_2d(
parameter_dictionary->GetBool("use_trajectory_builder_2d"));
options.set_use_trajectory_builder_3d(
parameter_dictionary->GetBool("use_trajectory_builder_3d"));
options.set_num_background_threads(
parameter_dictionary->GetNonNegativeInt("num_background_threads"));
*options.mutable_pose_graph_options() = CreatePoseGraphOptions(
parameter_dictionary->GetDictionary("pose_graph").get());
CHECK_NE(options.use_trajectory_builder_2d(),
options.use_trajectory_builder_3d());
return options;
}
MapBuilder::MapBuilder(const proto::MapBuilderOptions& options)
: options_(options), thread_pool_(options.num_background_threads()) {
CHECK(options.use_trajectory_builder_2d() ^
options.use_trajectory_builder_3d());
if (options.use_trajectory_builder_2d()) {
pose_graph_ = absl::make_unique<PoseGraph2D>(
options_.pose_graph_options(),
absl::make_unique<optimization::OptimizationProblem2D>(
options_.pose_graph_options().optimization_problem_options()),
&thread_pool_);
}
if (options.use_trajectory_builder_3d()) {
pose_graph_ = absl::make_unique<PoseGraph3D>(
options_.pose_graph_options(),
absl::make_unique<optimization::OptimizationProblem3D>(
options_.pose_graph_options().optimization_problem_options()),
&thread_pool_);
}
if (options.collate_by_trajectory()) {
sensor_collator_ = absl::make_unique<sensor::TrajectoryCollator>();
} else {
sensor_collator_ = absl::make_unique<sensor::Collator>();
}
}
int MapBuilder::AddTrajectoryBuilder(
const std::set<SensorId>& expected_sensor_ids,
const proto::TrajectoryBuilderOptions& trajectory_options,
LocalSlamResultCallback local_slam_result_callback) {
const int trajectory_id = trajectory_builders_.size();
if (options_.use_trajectory_builder_3d()) {
std::unique_ptr<LocalTrajectoryBuilder3D> local_trajectory_builder;
if (trajectory_options.has_trajectory_builder_3d_options()) {
local_trajectory_builder = absl::make_unique<LocalTrajectoryBuilder3D>(
trajectory_options.trajectory_builder_3d_options(),
SelectRangeSensorIds(expected_sensor_ids));
}
DCHECK(dynamic_cast<PoseGraph3D*>(pose_graph_.get()));
trajectory_builders_.push_back(absl::make_unique<CollatedTrajectoryBuilder>(
trajectory_options, sensor_collator_.get(), trajectory_id,
expected_sensor_ids,
CreateGlobalTrajectoryBuilder3D(
std::move(local_trajectory_builder), trajectory_id,
static_cast<PoseGraph3D*>(pose_graph_.get()),
local_slam_result_callback)));
} else {
std::unique_ptr<LocalTrajectoryBuilder2D> local_trajectory_builder;
if (trajectory_options.has_trajectory_builder_2d_options()) {
local_trajectory_builder = absl::make_unique<LocalTrajectoryBuilder2D>(
trajectory_options.trajectory_builder_2d_options(),
SelectRangeSensorIds(expected_sensor_ids));
}
DCHECK(dynamic_cast<PoseGraph2D*>(pose_graph_.get()));
trajectory_builders_.push_back(absl::make_unique<CollatedTrajectoryBuilder>(
trajectory_options, sensor_collator_.get(), trajectory_id,
expected_sensor_ids,
CreateGlobalTrajectoryBuilder2D(
std::move(local_trajectory_builder), trajectory_id,
static_cast<PoseGraph2D*>(pose_graph_.get()),
local_slam_result_callback)));
}
MaybeAddPureLocalizationTrimmer(trajectory_id, trajectory_options,
pose_graph_.get());
if (trajectory_options.has_initial_trajectory_pose()) {
const auto& initial_trajectory_pose =
trajectory_options.initial_trajectory_pose();
pose_graph_->SetInitialTrajectoryPose(
trajectory_id, initial_trajectory_pose.to_trajectory_id(),
transform::ToRigid3(initial_trajectory_pose.relative_pose()),
common::FromUniversal(initial_trajectory_pose.timestamp()));
}
proto::TrajectoryBuilderOptionsWithSensorIds options_with_sensor_ids_proto;
for (const auto& sensor_id : expected_sensor_ids) {
*options_with_sensor_ids_proto.add_sensor_id() = ToProto(sensor_id);
}
*options_with_sensor_ids_proto.mutable_trajectory_builder_options() =
trajectory_options;
all_trajectory_builder_options_.push_back(options_with_sensor_ids_proto);
CHECK_EQ(trajectory_builders_.size(), all_trajectory_builder_options_.size());
return trajectory_id;
}
int MapBuilder::AddTrajectoryForDeserialization(
const proto::TrajectoryBuilderOptionsWithSensorIds&
options_with_sensor_ids_proto) {
const int trajectory_id = trajectory_builders_.size();
trajectory_builders_.emplace_back();
all_trajectory_builder_options_.push_back(options_with_sensor_ids_proto);
CHECK_EQ(trajectory_builders_.size(), all_trajectory_builder_options_.size());
return trajectory_id;
}
void MapBuilder::FinishTrajectory(const int trajectory_id) {
sensor_collator_->FinishTrajectory(trajectory_id);
pose_graph_->FinishTrajectory(trajectory_id);
}
std::string MapBuilder::SubmapToProto(
const SubmapId& submap_id, proto::SubmapQuery::Response* const response) {
if (submap_id.trajectory_id < 0 ||
submap_id.trajectory_id >= num_trajectory_builders()) {
return "Requested submap from trajectory " +
std::to_string(submap_id.trajectory_id) + " but there are only " +
std::to_string(num_trajectory_builders()) + " trajectories.";
}
const auto submap_data = pose_graph_->GetSubmapData(submap_id);
if (submap_data.submap == nullptr) {
return "Requested submap " + std::to_string(submap_id.submap_index) +
" from trajectory " + std::to_string(submap_id.trajectory_id) +
" but it does not exist: maybe it has been trimmed.";
}
submap_data.submap->ToResponseProto(submap_data.pose, response);
return "";
}
void MapBuilder::SerializeState(bool include_unfinished_submaps,
io::ProtoStreamWriterInterface* const writer) {
io::WritePbStream(*pose_graph_, all_trajectory_builder_options_, writer,
include_unfinished_submaps);
}
std::map<int, int> MapBuilder::LoadState(
io::ProtoStreamReaderInterface* const reader, bool load_frozen_state) {
io::ProtoStreamDeserializer deserializer(reader);
// Create a copy of the pose_graph_proto, such that we can re-write the
// trajectory ids.
proto::PoseGraph pose_graph_proto = deserializer.pose_graph();
const auto& all_builder_options_proto =
deserializer.all_trajectory_builder_options();
std::map<int, int> trajectory_remapping;
for (int i = 0; i < pose_graph_proto.trajectory_size(); ++i) {
auto& trajectory_proto = *pose_graph_proto.mutable_trajectory(i);
const auto& options_with_sensor_ids_proto =
all_builder_options_proto.options_with_sensor_ids(i);
const int new_trajectory_id =
AddTrajectoryForDeserialization(options_with_sensor_ids_proto);
CHECK(trajectory_remapping
.emplace(trajectory_proto.trajectory_id(), new_trajectory_id)
.second)
<< "Duplicate trajectory ID: " << trajectory_proto.trajectory_id();
trajectory_proto.set_trajectory_id(new_trajectory_id);
if (load_frozen_state) {
pose_graph_->FreezeTrajectory(new_trajectory_id);
}
}
// Apply the calculated remapping to constraints in the pose graph proto.
for (auto& constraint_proto : *pose_graph_proto.mutable_constraint()) {
constraint_proto.mutable_submap_id()->set_trajectory_id(
trajectory_remapping.at(constraint_proto.submap_id().trajectory_id()));
constraint_proto.mutable_node_id()->set_trajectory_id(
trajectory_remapping.at(constraint_proto.node_id().trajectory_id()));
}
MapById<SubmapId, transform::Rigid3d> submap_poses;
for (const proto::Trajectory& trajectory_proto :
pose_graph_proto.trajectory()) {
for (const proto::Trajectory::Submap& submap_proto :
trajectory_proto.submap()) {
submap_poses.Insert(SubmapId{trajectory_proto.trajectory_id(),
submap_proto.submap_index()},
transform::ToRigid3(submap_proto.pose()));
}
}
MapById<NodeId, transform::Rigid3d> node_poses;
for (const proto::Trajectory& trajectory_proto :
pose_graph_proto.trajectory()) {
for (const proto::Trajectory::Node& node_proto : trajectory_proto.node()) {
node_poses.Insert(
NodeId{trajectory_proto.trajectory_id(), node_proto.node_index()},
transform::ToRigid3(node_proto.pose()));
}
}
// Set global poses of landmarks.
for (const auto& landmark : pose_graph_proto.landmark_poses()) {
pose_graph_->SetLandmarkPose(landmark.landmark_id(),
transform::ToRigid3(landmark.global_pose()));
}
MapById<SubmapId, mapping::proto::Submap> submap_id_to_submap;
MapById<NodeId, mapping::proto::Node> node_id_to_node;
SerializedData proto;
while (deserializer.ReadNextSerializedData(&proto)) {
switch (proto.data_case()) {
case SerializedData::kPoseGraph:
LOG(ERROR) << "Found multiple serialized `PoseGraph`. Serialized "
"stream likely corrupt!.";
break;
case SerializedData::kAllTrajectoryBuilderOptions:
LOG(ERROR) << "Found multiple serialized "
"`AllTrajectoryBuilderOptions`. Serialized stream likely "
"corrupt!.";
break;
case SerializedData::kSubmap: {
proto.mutable_submap()->mutable_submap_id()->set_trajectory_id(
trajectory_remapping.at(
proto.submap().submap_id().trajectory_id()));
submap_id_to_submap.Insert(
SubmapId{proto.submap().submap_id().trajectory_id(),
proto.submap().submap_id().submap_index()},
proto.submap());
break;
}
case SerializedData::kNode: {
proto.mutable_node()->mutable_node_id()->set_trajectory_id(
trajectory_remapping.at(proto.node().node_id().trajectory_id()));
const NodeId node_id(proto.node().node_id().trajectory_id(),
proto.node().node_id().node_index());
const transform::Rigid3d& node_pose = node_poses.at(node_id);
pose_graph_->AddNodeFromProto(node_pose, proto.node());
node_id_to_node.Insert(node_id, proto.node());
break;
}
case SerializedData::kTrajectoryData: {
proto.mutable_trajectory_data()->set_trajectory_id(
trajectory_remapping.at(proto.trajectory_data().trajectory_id()));
pose_graph_->SetTrajectoryDataFromProto(proto.trajectory_data());
break;
}
case SerializedData::kImuData: {
if (load_frozen_state) break;
pose_graph_->AddImuData(
trajectory_remapping.at(proto.imu_data().trajectory_id()),
sensor::FromProto(proto.imu_data().imu_data()));
break;
}
case SerializedData::kOdometryData: {
if (load_frozen_state) break;
pose_graph_->AddOdometryData(
trajectory_remapping.at(proto.odometry_data().trajectory_id()),
sensor::FromProto(proto.odometry_data().odometry_data()));
break;
}
case SerializedData::kFixedFramePoseData: {
if (load_frozen_state) break;
pose_graph_->AddFixedFramePoseData(
trajectory_remapping.at(
proto.fixed_frame_pose_data().trajectory_id()),
sensor::FromProto(
proto.fixed_frame_pose_data().fixed_frame_pose_data()));
break;
}
case SerializedData::kLandmarkData: {
if (load_frozen_state) break;
pose_graph_->AddLandmarkData(
trajectory_remapping.at(proto.landmark_data().trajectory_id()),
sensor::FromProto(proto.landmark_data().landmark_data()));
break;
}
default:
LOG(WARNING) << "Skipping unknown message type in stream: "
<< proto.GetTypeName();
}
}
// TODO(schwoere): Remove backwards compatibility once the pbstream format
// version 2 is established.
if (deserializer.header().format_version() ==
io::kFormatVersionWithoutSubmapHistograms) {
submap_id_to_submap =
cartographer::io::MigrateSubmapFormatVersion1ToVersion2(
submap_id_to_submap, node_id_to_node, pose_graph_proto);
}
for (const auto& submap_id_submap : submap_id_to_submap) {
pose_graph_->AddSubmapFromProto(submap_poses.at(submap_id_submap.id),
submap_id_submap.data);
}
if (load_frozen_state) {
// Add information about which nodes belong to which submap.
// Required for 3D pure localization.
for (const proto::PoseGraph::Constraint& constraint_proto :
pose_graph_proto.constraint()) {
if (constraint_proto.tag() !=
proto::PoseGraph::Constraint::INTRA_SUBMAP) {
continue;
}
pose_graph_->AddNodeToSubmap(
NodeId{constraint_proto.node_id().trajectory_id(),
constraint_proto.node_id().node_index()},
SubmapId{constraint_proto.submap_id().trajectory_id(),
constraint_proto.submap_id().submap_index()});
}
} else {
// When loading unfrozen trajectories, 'AddSerializedConstraints' will
// take care of adding information about which nodes belong to which
// submap.
pose_graph_->AddSerializedConstraints(
FromProto(pose_graph_proto.constraint()));
}
CHECK(reader->eof());
return trajectory_remapping;
}
std::map<int, int> MapBuilder::LoadStateFromFile(
const std::string& state_filename) {
const std::string suffix = ".pbstream";
if (state_filename.substr(
std::max<int>(state_filename.size() - suffix.size(), 0)) != suffix) {
LOG(WARNING) << "The file containing the state should be a "
".pbstream file.";
}
LOG(INFO) << "Loading saved state '" << state_filename << "'...";
io::ProtoStreamReader stream(state_filename);
return LoadState(&stream, true);
}
} // namespace mapping
} // namespace cartographer
| [
"[email protected]"
] | |
8d85a96e2987285412807bf7aa6e7d3c057206e0 | fa623d526d6ca624d60a702f5c6671cbcec1c23e | /praduck/levelmap.h | d128d14e50a77a1eba2a03375c8b2745fa81195f | [] | no_license | imclab/plusplus-warrior | a9e3372de7bfbdc68efc2f9936efb6e035b80825 | 668279f82ca7a641d68c66d87589f2327eb0403c | refs/heads/master | 2021-05-01T20:31:36.547667 | 2014-02-06T03:14:49 | 2014-02-06T03:14:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 780 | h | #ifndef __praduck__LevelMap__
#define __praduck__LevelMap__
#include <iostream>
#include <fstream>
#include <iomanip>
#include "BaseTile.h"
#include "CreatureTile.h"
class TileController;
using namespace std;
class LevelMap {
protected:
BaseTile* map[20][20];
BaseTile* TileFromChar(char c);
public:
int width, height;
CreatureTile** creatures = new CreatureTile*[20];
TileController** controllers = new TileController*[20];
int creatureCount = 0;
BaseTile* GetTile (int x, int y);
void SetTile(int x, int y, BaseTile* value);
int MoveTile(BaseTile* tile, int x, int y);
void PrintMap(ostream& output);
void LoadMap(string filename);
};
ostream& operator<<(ostream& os, LevelMap& lm);
#endif /* defined(__praduck__LevelMap__) */ | [
"[email protected]"
] | |
29cb0510e98b37a20bd1f7ea4b7d36b954711aad | efe2b4dedbc6bab31ffe88c271daa5463f8649f6 | /branches/fast-extension/src/udp_tracker_connection.cpp | d08abd3595eacec600dec250f555c23f5efea516 | [] | no_license | svn2github/libtorrent | 867c84f0c271cdc255c3e268c17db75d46010dde | 8cfe21e253d8b90086bb0b15c6c881795bf12ea1 | refs/heads/master | 2020-03-30T03:50:32.931129 | 2015-01-07T23:21:54 | 2015-01-07T23:21:54 | 17,344,601 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 14,411 | cpp | /*
Copyright (c) 2003, Arvid Norberg
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
* Neither the name of the author nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#include "libtorrent/pch.hpp"
#include <vector>
#include <iostream>
#include <cctype>
#include <iomanip>
#include <sstream>
#include "zlib.h"
#ifdef _MSC_VER
#pragma warning(push, 1)
#endif
#include <boost/bind.hpp>
#include <boost/lexical_cast.hpp>
#ifdef _MSC_VER
#pragma warning(pop)
#endif
#include "libtorrent/tracker_manager.hpp"
#include "libtorrent/udp_tracker_connection.hpp"
#include "libtorrent/io.hpp"
namespace
{
enum
{
udp_connection_retries = 4,
udp_announce_retries = 15,
udp_connect_timeout = 15,
udp_announce_timeout = 10,
udp_buffer_size = 2048
};
}
using boost::bind;
using boost::lexical_cast;
namespace libtorrent
{
udp_tracker_connection::udp_tracker_connection(
asio::strand& str
, tracker_manager& man
, tracker_request const& req
, std::string const& hostname
, unsigned short port
, address bind_infc
, boost::weak_ptr<request_callback> c
, session_settings const& stn)
: tracker_connection(man, req, str, bind_infc, c)
, m_man(man)
, m_strand(str)
, m_name_lookup(m_strand.io_service())
, m_transaction_id(0)
, m_connection_id(0)
, m_settings(stn)
, m_attempts(0)
{
udp::resolver::query q(hostname, boost::lexical_cast<std::string>(port));
m_name_lookup.async_resolve(q
, m_strand.wrap(boost::bind(
&udp_tracker_connection::name_lookup, self(), _1, _2)));
set_timeout(m_settings.tracker_completion_timeout
, m_settings.tracker_receive_timeout);
}
void udp_tracker_connection::name_lookup(asio::error_code const& error
, udp::resolver::iterator i) try
{
if (error == asio::error::operation_aborted) return;
if (!m_socket) return; // the operation was aborted
if (error || i == udp::resolver::iterator())
{
fail(-1, error.message().c_str());
return;
}
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
if (has_requester()) requester().debug_log("udp tracker name lookup successful");
#endif
restart_read_timeout();
// look for an address that has the same kind as the one
// we're listening on. To make sure the tracker get our
// correct listening address.
udp::resolver::iterator target = i;
udp::resolver::iterator end;
udp::endpoint target_address = *i;
for (; target != end && target->endpoint().address().is_v4()
!= bind_interface().is_v4(); ++target);
if (target == end)
{
assert(target_address.address().is_v4() != bind_interface().is_v4());
if (has_requester())
{
std::string tracker_address_type = target_address.address().is_v4() ? "IPv4" : "IPv6";
std::string bind_address_type = bind_interface().is_v4() ? "IPv4" : "IPv6";
requester().tracker_warning("the tracker only resolves to an "
+ tracker_address_type + " address, and you're listening on an "
+ bind_address_type + " socket. This may prevent you from receiving incoming connections.");
}
}
else
{
target_address = *target;
}
if (has_requester()) requester().m_tracker_address = tcp::endpoint(target_address.address(), target_address.port());
m_target = target_address;
m_socket.reset(new datagram_socket(m_name_lookup.io_service()));
m_socket->open(target_address.protocol());
m_socket->bind(udp::endpoint(bind_interface(), 0));
m_socket->connect(target_address);
send_udp_connect();
}
catch (std::exception& e)
{
fail(-1, e.what());
};
void udp_tracker_connection::on_timeout()
{
m_socket.reset();
m_name_lookup.cancel();
fail_timeout();
}
void udp_tracker_connection::send_udp_connect()
{
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
if (has_requester())
{
requester().debug_log("==> UDP_TRACKER_CONNECT ["
+ lexical_cast<std::string>(tracker_req().info_hash) + "]");
}
#endif
if (!m_socket) return; // the operation was aborted
char send_buf[16];
char* ptr = send_buf;
if (m_transaction_id == 0)
m_transaction_id = rand() ^ (rand() << 16);
// connection_id
detail::write_uint32(0x417, ptr);
detail::write_uint32(0x27101980, ptr);
// action (connect)
detail::write_int32(action_connect, ptr);
// transaction_id
detail::write_int32(m_transaction_id, ptr);
m_socket->send(asio::buffer((void*)send_buf, 16), 0);
++m_attempts;
m_buffer.resize(udp_buffer_size);
m_socket->async_receive_from(asio::buffer(m_buffer), m_sender
, boost::bind(&udp_tracker_connection::connect_response, self(), _1, _2));
}
void udp_tracker_connection::connect_response(asio::error_code const& error
, std::size_t bytes_transferred) try
{
if (error == asio::error::operation_aborted) return;
if (!m_socket) return; // the operation was aborted
if (error)
{
fail(-1, error.message().c_str());
return;
}
if (m_target != m_sender)
{
// this packet was not received from the tracker
m_socket->async_receive_from(asio::buffer(m_buffer), m_sender
, boost::bind(&udp_tracker_connection::connect_response, self(), _1, _2));
return;
}
if (bytes_transferred >= udp_buffer_size)
{
fail(-1, "udp response too big");
return;
}
if (bytes_transferred < 8)
{
fail(-1, "got a message with size < 8");
return;
}
restart_read_timeout();
const char* ptr = &m_buffer[0];
int action = detail::read_int32(ptr);
int transaction = detail::read_int32(ptr);
if (action == action_error)
{
fail(-1, std::string(ptr, bytes_transferred - 8).c_str());
return;
}
if (action != action_connect)
{
fail(-1, "invalid action in connect reply");
return;
}
if (m_transaction_id != transaction)
{
fail(-1, "incorrect transaction id");
return;
}
if (bytes_transferred < 16)
{
fail(-1, "udp_tracker_connection: "
"got a message with size < 16");
return;
}
// reset transaction
m_transaction_id = 0;
m_attempts = 0;
m_connection_id = detail::read_int64(ptr);
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
if (has_requester())
{
requester().debug_log("<== UDP_TRACKER_CONNECT_RESPONSE ["
+ lexical_cast<std::string>(m_connection_id) + "]");
}
#endif
if (tracker_req().kind == tracker_request::announce_request)
send_udp_announce();
else if (tracker_req().kind == tracker_request::scrape_request)
send_udp_scrape();
}
catch (std::exception& e)
{
fail(-1, e.what());
}
void udp_tracker_connection::send_udp_announce()
{
if (m_transaction_id == 0)
m_transaction_id = rand() ^ (rand() << 16);
if (!m_socket) return; // the operation was aborted
std::vector<char> buf;
std::back_insert_iterator<std::vector<char> > out(buf);
tracker_request const& req = tracker_req();
// connection_id
detail::write_int64(m_connection_id, out);
// action (announce)
detail::write_int32(action_announce, out);
// transaction_id
detail::write_int32(m_transaction_id, out);
// info_hash
std::copy(req.info_hash.begin(), req.info_hash.end(), out);
// peer_id
std::copy(req.pid.begin(), req.pid.end(), out);
// downloaded
detail::write_int64(req.downloaded, out);
// left
detail::write_int64(req.left, out);
// uploaded
detail::write_int64(req.uploaded, out);
// event
detail::write_int32(req.event, out);
// ip address
if (m_settings.announce_ip != address() && m_settings.announce_ip.is_v4())
detail::write_uint32(m_settings.announce_ip.to_v4().to_ulong(), out);
else
detail::write_int32(0, out);
// key
detail::write_int32(req.key, out);
// num_want
detail::write_int32(req.num_want, out);
// port
detail::write_uint16(req.listen_port, out);
// extensions
detail::write_uint16(0, out);
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
if (has_requester())
{
requester().debug_log("==> UDP_TRACKER_ANNOUNCE ["
+ lexical_cast<std::string>(req.info_hash) + "]");
}
#endif
m_socket->send(asio::buffer(buf), 0);
++m_attempts;
m_socket->async_receive_from(asio::buffer(m_buffer), m_sender
, bind(&udp_tracker_connection::announce_response, self(), _1, _2));
}
void udp_tracker_connection::send_udp_scrape()
{
if (m_transaction_id == 0)
m_transaction_id = rand() ^ (rand() << 16);
if (!m_socket) return; // the operation was aborted
std::vector<char> buf;
std::back_insert_iterator<std::vector<char> > out(buf);
// connection_id
detail::write_int64(m_connection_id, out);
// action (scrape)
detail::write_int32(action_scrape, out);
// transaction_id
detail::write_int32(m_transaction_id, out);
// info_hash
std::copy(tracker_req().info_hash.begin(), tracker_req().info_hash.end(), out);
m_socket->send(asio::buffer(&buf[0], buf.size()), 0);
++m_attempts;
m_socket->async_receive_from(asio::buffer(m_buffer), m_sender
, bind(&udp_tracker_connection::scrape_response, self(), _1, _2));
}
void udp_tracker_connection::announce_response(asio::error_code const& error
, std::size_t bytes_transferred) try
{
if (error == asio::error::operation_aborted) return;
if (!m_socket) return; // the operation was aborted
if (error)
{
fail(-1, error.message().c_str());
return;
}
if (m_target != m_sender)
{
// this packet was not received from the tracker
m_socket->async_receive_from(asio::buffer(m_buffer), m_sender
, bind(&udp_tracker_connection::connect_response, self(), _1, _2));
return;
}
if (bytes_transferred >= udp_buffer_size)
{
fail(-1, "udp response too big");
return;
}
if (bytes_transferred < 8)
{
fail(-1, "got a message with size < 8");
return;
}
restart_read_timeout();
char* buf = &m_buffer[0];
int action = detail::read_int32(buf);
int transaction = detail::read_int32(buf);
if (transaction != m_transaction_id)
{
fail(-1, "incorrect transaction id");
return;
}
if (action == action_error)
{
fail(-1, std::string(buf, bytes_transferred - 8).c_str());
return;
}
if (action != action_announce)
{
fail(-1, "invalid action in announce response");
return;
}
if (bytes_transferred < 20)
{
fail(-1, "got a message with size < 20");
return;
}
int interval = detail::read_int32(buf);
int incomplete = detail::read_int32(buf);
int complete = detail::read_int32(buf);
int num_peers = (bytes_transferred - 20) / 6;
if ((bytes_transferred - 20) % 6 != 0)
{
fail(-1, "invalid udp tracker response length");
return;
}
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
if (has_requester())
{
requester().debug_log("<== UDP_TRACKER_ANNOUNCE_RESPONSE");
}
#endif
if (!has_requester())
{
m_man.remove_request(this);
return;
}
std::vector<peer_entry> peer_list;
for (int i = 0; i < num_peers; ++i)
{
peer_entry e;
std::stringstream s;
s << (int)detail::read_uint8(buf) << ".";
s << (int)detail::read_uint8(buf) << ".";
s << (int)detail::read_uint8(buf) << ".";
s << (int)detail::read_uint8(buf);
e.ip = s.str();
e.port = detail::read_uint16(buf);
e.pid.clear();
peer_list.push_back(e);
}
requester().tracker_response(tracker_req(), peer_list, interval
, complete, incomplete);
m_man.remove_request(this);
return;
}
catch (std::exception& e)
{
fail(-1, e.what());
}; // msvc 7.1 seems to require this
void udp_tracker_connection::scrape_response(asio::error_code const& error
, std::size_t bytes_transferred) try
{
if (error == asio::error::operation_aborted) return;
if (!m_socket) return; // the operation was aborted
if (error)
{
fail(-1, error.message().c_str());
return;
}
if (m_target != m_sender)
{
// this packet was not received from the tracker
m_socket->async_receive_from(asio::buffer(m_buffer), m_sender
, bind(&udp_tracker_connection::connect_response, self(), _1, _2));
return;
}
if (bytes_transferred >= udp_buffer_size)
{
fail(-1, "udp response too big");
return;
}
if (bytes_transferred < 8)
{
fail(-1, "got a message with size < 8");
return;
}
restart_read_timeout();
char* buf = &m_buffer[0];
int action = detail::read_int32(buf);
int transaction = detail::read_int32(buf);
if (transaction != m_transaction_id)
{
fail(-1, "incorrect transaction id");
return;
}
if (action == action_error)
{
fail(-1, std::string(buf, bytes_transferred - 8).c_str());
return;
}
if (action != action_scrape)
{
fail(-1, "invalid action in announce response");
return;
}
if (bytes_transferred < 20)
{
fail(-1, "got a message with size < 20");
return;
}
int complete = detail::read_int32(buf);
/*int downloaded = */detail::read_int32(buf);
int incomplete = detail::read_int32(buf);
if (!has_requester())
{
m_man.remove_request(this);
return;
}
std::vector<peer_entry> peer_list;
requester().tracker_response(tracker_req(), peer_list, 0
, complete, incomplete);
m_man.remove_request(this);
}
catch (std::exception& e)
{
fail(-1, e.what());
}
}
| [
"arvidn@f43f7eb3-cfe1-5f9d-1b5f-e45aa6702bda"
] | arvidn@f43f7eb3-cfe1-5f9d-1b5f-e45aa6702bda |
373b86995aaeba7d31ab4a985ec4d24233a0a3a5 | 1815b64a60fa9d0ccd3270d53cd176536558153f | /chrome/browser/policy/messaging_layer/util/heartbeat_event_factory.cc | 4aab15858c2ce01ee974b486c74f51c320413c15 | [
"BSD-3-Clause"
] | permissive | violetForeden/chromium | ae8c65739de96dd141136e6523b4a2c5978491d9 | 43f3ea874caca29eead4dc4dfb1c8ce6f11fa5da | refs/heads/main | 2023-06-29T09:43:21.454580 | 2021-09-12T08:27:01 | 2021-09-12T08:27:01 | 405,598,541 | 1 | 0 | BSD-3-Clause | 2021-09-12T09:22:55 | 2021-09-12T09:22:55 | null | UTF-8 | C++ | false | false | 1,693 | cc | // Copyright 2021 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/policy/messaging_layer/util/heartbeat_event_factory.h"
#include "chrome/browser/policy/messaging_layer/util/heartbeat_event.h"
#include "chrome/browser/profiles/profile.h"
#include "components/keyed_service/content/browser_context_dependency_manager.h"
#if BUILDFLAG(IS_CHROMEOS_ASH)
#include "chrome/browser/ash/policy/core/user_cloud_policy_manager_ash.h"
#else
#include "components/policy/core/common/cloud/user_cloud_policy_manager.h"
#endif
namespace reporting {
HeartbeatEventFactory* HeartbeatEventFactory::GetInstance() {
return base::Singleton<HeartbeatEventFactory>::get();
}
HeartbeatEventFactory::HeartbeatEventFactory()
: BrowserContextKeyedServiceFactory(
"HeartbeatEvent",
BrowserContextDependencyManager::GetInstance()) {}
HeartbeatEventFactory::~HeartbeatEventFactory() = default;
KeyedService* HeartbeatEventFactory::BuildServiceInstanceFor(
content::BrowserContext* context) const {
Profile* profile = static_cast<Profile*>(context);
#if BUILDFLAG(IS_CHROMEOS_ASH)
policy::UserCloudPolicyManagerAsh* manager =
profile->GetUserCloudPolicyManagerAsh();
#else
policy::UserCloudPolicyManager* manager =
profile->GetUserCloudPolicyManager();
#endif
if (!manager) {
return nullptr;
}
return new HeartbeatEvent(manager);
}
bool HeartbeatEventFactory::ServiceIsCreatedWithBrowserContext() const {
return true;
}
bool HeartbeatEventFactory::ServiceIsNULLWhileTesting() const {
return true;
}
} // namespace reporting
| [
"[email protected]"
] | |
529d86e6767550da9d1dd9a8261c6098364d2487 | 5e1cf134e9be0c30ab0f1175e578ebc2917eab9e | /PrimeC++/beforeJan17_2016/callPrivate.cpp | 9c6d0f6511a82ced4f4b2ea35a7c933d7135c19d | [] | no_license | LiehuoChen/CPLUSPLUS_STUDY | d0d1339113d8ff34a1bcb4dec7db4ecd3f22c291 | 2cda080b1ab7893db4145542db69ca2b1c03bc48 | refs/heads/master | 2021-01-10T16:57:42.639576 | 2016-01-17T23:54:37 | 2016-01-17T23:54:37 | 49,798,875 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 389 | cpp |
#include<iostream>
using namespace std;
class Base {
public:
virtual int fun(int i) { cout << "Base::fun(int i) called" << endl; }
};
class Derived: public Base {
private:
int fun(int x) { cout << "Derived::fun(int x) called" << endl; }
};
int main()
{
//Derived *ptrD = new Derived;
//ptrD->fun(10);
Base *ptr = new Derived;
ptr->fun(10);
return 0;
}
| [
"[email protected]"
] | |
47f03ff81ab71217cc3e8ebabdfcf6502f96132f | 78590c60dac38e9b585d0a277ea76944544e9bd8 | /src/pool/pstring.cxx | 4c17513a96aee622eaf9cc3b0170584ad44c15df | [] | no_license | sandeshdevadiga/beng-proxy | 05adedcf28c31ad5fbaa073f85e5d2d420e5b3ca | 436e8de75a28aa8c7b09f6ed97c1a1dfcf0fcfc4 | refs/heads/master | 2023-03-02T09:04:20.466704 | 2021-02-11T17:05:38 | 2021-02-11T17:10:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,133 | cxx | /*
* Copyright 2007-2021 CM4all GmbH
* All rights reserved.
*
* author: Max Kellermann <[email protected]>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the
* distribution.
*
* 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
* FOUNDATION 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 "pool.hxx"
#include "util/CharUtil.hxx"
#include "util/StringView.hxx"
#include <algorithm>
#include <assert.h>
#include <string.h>
#include <stdarg.h>
#include <stdio.h>
static char *
Copy(char *dest, const char *src, size_t n) noexcept
{
return std::copy_n(src, n, dest);
}
static char *
CopyLower(char *dest, const char *src, size_t n) noexcept
{
return std::transform(src, src + n, dest, ToLowerASCII);
}
void *
p_memdup(struct pool *pool, const void *src, size_t length
TRACE_ARGS_DECL) noexcept
{
void *dest = p_malloc_fwd(pool, length);
memcpy(dest, src, length);
return dest;
}
char *
p_strdup(struct pool *pool, const char *src
TRACE_ARGS_DECL) noexcept
{
return (char *)p_memdup_fwd(pool, src, strlen(src) + 1);
}
char *
p_strndup(struct pool *pool, const char *src, size_t length
TRACE_ARGS_DECL) noexcept
{
char *dest = (char *)p_malloc_fwd(pool, length + 1);
*Copy(dest, src, length) = 0;
return dest;
}
char *
p_strdup(struct pool &pool, StringView src TRACE_ARGS_DECL) noexcept
{
char *dest = (char *)p_malloc_fwd(&pool, src.size + 1);
*Copy(dest, src.data, src.size) = 0;
return dest;
}
char *
p_strdup_lower(struct pool &pool, StringView src TRACE_ARGS_DECL) noexcept
{
char *dest = (char *)p_malloc_fwd(&pool, src.size + 1);
*CopyLower(dest, src.data, src.size) = 0;
return dest;
}
char * gcc_malloc
p_sprintf(struct pool *pool, const char *fmt, ...) noexcept
{
va_list ap;
va_start(ap, fmt);
size_t length = (size_t)vsnprintf(nullptr, 0, fmt, ap) + 1;
va_end(ap);
char *p = (char *)p_malloc(pool, length);
va_start(ap, fmt);
gcc_unused int length2 = vsnprintf(p, length, fmt, ap);
va_end(ap);
assert((size_t)length2 + 1 == length);
return p;
}
| [
"[email protected]"
] | |
beda539299351df342cb8150329bafea3b430413 | d85f2df596f794c92d1a36ffa3d99c389b30e797 | /ArquiSoftSolid/ClienteCredito.cpp | d6d7d05bc655bba289fdf7f132a19c312e0db451 | [] | no_license | kevdie/SOLID | 057717e683e11987d4d20b647c972721ee726a26 | 9cc2903bf243ff0e6f73e5a4f070737273a8361f | refs/heads/master | 2022-12-28T08:08:26.816722 | 2020-10-13T16:28:14 | 2020-10-13T16:28:14 | 303,761,529 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 754 | cpp | #include "ClienteCredito.h"
int ClienteCredito::getTotalPagos()
{
return totalPagos;
}
void ClienteCredito::setTotalPagos(int totalPagos)
{
this->totalPagos = totalPagos;
}
int ClienteCredito::getPagosRealizados()
{
return pagosRealizados;
}
void ClienteCredito::setPagosRealizados(int pagosRealizados)
{
this->pagosRealizados = pagosRealizados;
}
int ClienteCredito::getMontoTotal()
{
return montoTotal;
}
void ClienteCredito::setMontoTotal(int montoTotal)
{
this->montoTotal = montoTotal;
}
void ClienteCredito::mostrar()
{
cout << "CLIENTE A CREDITO" << endl;
Cliente::mostrar();
cout << "Total Pagos: " << totalPagos << endl;
cout << "Pagos Realizados: " << pagosRealizados << endl;
cout << "Monto total: " << montoTotal << endl;
}
| [
"[email protected]"
] | |
199f1967544ea0551c4caf575dcb5a6050442f1a | 24068d8b6d306b17beb5c99ca1c113b972929764 | /SocialGameOpenGLApplication/PrologEngine.h | e354079c6343cdf7f3c142c26f2b913cabb9a404 | [] | no_license | brunoflavio-com/engenius | 1a33a772d691fd4d601957675de37edd582d2c2e | 0164eefdf59fd8c36ec04b285cdce58bc9683687 | refs/heads/master | 2020-12-31T02:48:44.104432 | 2014-01-16T14:04:53 | 2014-01-16T14:04:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 298 | h | #pragma once
#include <SWI-cpp.h>
class PrologEngine
{
public:
static PrologEngine& getInstance();
PlEngine * getEngine();
private:
PrologEngine();
~PrologEngine();
PlEngine * swiprolog;
//disallow copies.
PrologEngine(PrologEngine const&);
void operator=(PrologEngine const&);
}; | [
"[email protected]"
] | |
b05b768585a2da7932ef59055e8fbfd2723bd683 | f77c9ed429f4bdc903815fccb5d5efcdd3110a7f | /RovController/Sensors/ImuSensor.cpp | 6935589c85601723cecb982475254c8dc2bbc33c | [] | no_license | lawrence-tech-rov-team/Rov-Controller | 1e348c780ec854a06c6862b636a5e1f91379e123 | 0ac227c88e6630d933af16d1f5e7ebdf6cfa9b69 | refs/heads/master | 2020-12-02T23:46:59.091308 | 2020-05-04T20:39:22 | 2020-05-04T20:39:22 | 231,159,016 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,733 | cpp | /*
* ImuSensor.cpp
*
* Created: 2/19/2020 8:49:46 PM
* Author: zcarey
*/
#include "ImuSensor.h"
#include "../Robot.h"
ImuSensor::ImuSensor(const uint8_t TempId, const uint8_t AccelId, const uint8_t MagId, const uint8_t GyroId, const uint8_t EulerId, const uint8_t LinearId, const uint8_t GravityId, const uint8_t QuatId)
: imu(55, 0x28), tempId(TempId), accelId(AccelId), magId(MagId), gyroId(GyroId), eulerId(EulerId), linearId(LinearId), gravityId(GravityId), quatId(QuatId)
{
}
bool ImuSensor::begin(){
return
rov.RegisterDevice(tempId, this)
&& rov.RegisterDevice(accelId, this)
&& rov.RegisterDevice(magId, this)
&& rov.RegisterDevice(gyroId, this)
&& rov.RegisterDevice(eulerId, this)
&& rov.RegisterDevice(linearId, this)
&& rov.RegisterDevice(gravityId, this)
&& rov.RegisterDevice(quatId, this)
&& imu.begin();
}
void ImuSensor::Update(uint8_t* buffer){
}
void ImuSensor::ReadRegisterRequested(uint8_t id, uint8_t* buffer){
if(id == tempId){
buffer[0] = imu.getTemp();
SendCommand(id, 1);
}else if(id == accelId) {
SendCommand(id, imu.getVector(Adafruit_BNO055::VECTOR_ACCELEROMETER, buffer));
}else if(id == magId){
SendCommand(id, imu.getVector(Adafruit_BNO055::VECTOR_MAGNETOMETER, buffer));
}else if(id == gyroId){
SendCommand(id, imu.getVector(Adafruit_BNO055::VECTOR_GYROSCOPE, buffer));
}else if(id == eulerId){
SendCommand(id, imu.getVector(Adafruit_BNO055::VECTOR_EULER, buffer));
}else if(id == linearId){
SendCommand(id, imu.getVector(Adafruit_BNO055::VECTOR_LINEARACCEL, buffer));
}else if(id == gravityId){
SendCommand(id, imu.getVector(Adafruit_BNO055::VECTOR_GRAVITY, buffer));
}else if(id == quatId){
SendCommand(id, imu.getQuat(buffer));
}
} | [
"[email protected]"
] | |
c3073a438eb84ebb36e12fe23b7bb73d4597609a | eaba85a3864089c45b9820052162529e1a4b7b77 | /src/ds-algo/trie.cpp | d4f9e8fd634b71285118e1ebfbd22403c7d23147 | [] | no_license | shafwanur010/cp | 77efc596af1038ba2c4769988fc948803ea10d78 | 1d0fc234956e8b469b1ed769c9fa1bae4a72888a | refs/heads/master | 2023-09-03T23:04:05.054541 | 2023-08-19T06:20:50 | 2023-08-19T06:20:50 | 288,452,374 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,505 | cpp | #include <bits/stdc++.h>
using namespace std;
struct node {
node *child[26];
bool isEnd;
};
node* make() {
node *u = new node;
for (int i = 0; i < 26; i++) {
u->child[i] = nullptr;
}
u->isEnd = false;
return u;
}
void insert(node *root, string s) {
node *u = root;
for (char c : s) {
int idx = c - 'a';
if (u->child[idx] == nullptr) {
u->child[idx] = make();
}
u = u->child[idx];
}
u->isEnd = true;
}
bool search(node *root, string s) {
node *u = root;
for (char c : s) {
int idx = c - 'a';
if (u->child[idx] == nullptr) {
return false;
}
u = u->child[idx];
}
return (u != nullptr and u->isEnd);
}
bool isEmpty(node *root) {
for (int i = 0; i < 26; i++) {
if (root->child[i] != nullptr) {
return false;
}
}
return true;
}
node* remove(node *root, string s, int dep = 0) {
if (root == nullptr) {
return nullptr;
}
if (dep == (int) s.size()) {
if (root->isEnd) {
root->isEnd = false;
}
if (isEmpty(root)) {
delete root;
root = nullptr;
}
return root;
}
int idx = s[dep] - 'a';
root->child[idx] = remove(root->child[idx], s, dep + 1);
if (isEmpty(root) and !root->isEnd) {
delete root;
root = nullptr;
}
return root;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
node *root = make();
insert(root, "abcd");
cout << search(root, "abcd") << '\n';
remove(root, "abcd");
cout << search(root, "abcd") << '\n';
}
| [
"[email protected]"
] | |
4ab5076d09392144a7e0b02e9ba61e504671668d | 8739fbb376ece424772c617874affb1040739916 | /stencils/TurbViscosityBufferFillStencil.cpp | 8b13900a8ec7a03bab83d2a3843aae833d1cc416 | [] | no_license | gasteigerjo/turbulent | 6d34c0aeba0ff797d0d327f50268dc791e405f94 | ed61a9503312c99abfe5ffc577f398f7b549681d | refs/heads/master | 2022-03-12T07:43:28.750274 | 2016-01-25T14:38:52 | 2016-01-25T14:38:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,231 | cpp | #include "TurbViscosityBufferFillStencil.h"
TurbViscosityBufferFillStencil::TurbViscosityBufferFillStencil(const Parameters & parameters,
FLOAT * turbViscLeft, FLOAT * turbViscRight,
FLOAT * turbViscBottom, FLOAT * turbViscTop,
int lowOffset) :
ScalarBufferFillStencil<TurbulentFlowField>(parameters,turbViscLeft,turbViscRight,turbViscBottom,turbViscTop,lowOffset)
{}
TurbViscosityBufferFillStencil::TurbViscosityBufferFillStencil(const Parameters & parameters,
FLOAT * turbViscLeft, FLOAT * turbViscRight,
FLOAT * turbViscBottom, FLOAT * turbViscTop,
FLOAT * turbViscFront, FLOAT * turbViscBack,
int lowOffset) :
ScalarBufferFillStencil<TurbulentFlowField>(parameters,turbViscLeft,turbViscRight,turbViscBottom,turbViscTop,turbViscFront,turbViscBack,lowOffset)
{}
// 2D problem
FLOAT & TurbViscosityBufferFillStencil::getScalar( TurbulentFlowField & turbFlowField, int i, int j ){
return turbFlowField.getTurbViscosity().getScalar(i,j);
}
// 3D problem
FLOAT & TurbViscosityBufferFillStencil::getScalar( TurbulentFlowField & turbFlowField, int i, int j, int k ){
return turbFlowField.getTurbViscosity().getScalar(i,j,k);
}
| [
"[email protected]"
] | |
6f74e6851a700687498ca18d0785515c19ebc43e | 881065f461f7bc9abd1a99dd2e09da78d0348c01 | /Programm/VokabeltrainerDGJE.cpp | b507d7c152b915a79ea95de92ce2063ea5961ea0 | [] | no_license | DennisGoss99/Projekt-Voc | 14a2f0618e7413b510c4c0944e186044b37230f7 | c94f51414808959caa34422b60a8b2105668a421 | refs/heads/master | 2020-05-06T15:18:46.559369 | 2019-04-30T21:09:46 | 2019-04-30T21:09:46 | 180,183,380 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,108 | cpp | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
#include <tchar.h>
//---------------------------------------------------------------------------
#include <Vcl.Styles.hpp>
#include <Vcl.Themes.hpp>
USEFORM("uFrmCheckVoc.cpp", frmCheckVoc);
USEFORM("uFrmMain.cpp", frmMain);
USEFORM("uFrmAddVoc.cpp", frmAddVoc);
//---------------------------------------------------------------------------
int WINAPI _tWinMain(HINSTANCE, HINSTANCE, LPTSTR, int)
{
try
{
Application->Initialize();
Application->MainFormOnTaskBar = true;
Application->CreateForm(__classid(TfrmMain), &frmMain);
Application->CreateForm(__classid(TfrmAddVoc), &frmAddVoc);
Application->CreateForm(__classid(TfrmCheckVoc), &frmCheckVoc);
Application->Run();
}
catch (Exception &exception)
{
Application->ShowException(&exception);
}
catch (...)
{
try
{
throw Exception("");
}
catch (Exception &exception)
{
Application->ShowException(&exception);
}
}
return 0;
}
//---------------------------------------------------------------------------
| [
"[email protected]"
] | |
d232b04c5868575cdf2289515c9b811f68c769d6 | 7568cf9fc1eee857141ab265311edcaf964f54b4 | /components/omnibox/common/omnibox_features.cc | aa4ae3d6a631c711ccd82ba9d9112638afd1d90c | [
"BSD-3-Clause"
] | permissive | cbosoft/chromium | f4f0c9e1ae596850c04038eed34d21040103569f | 072e9137131be2f8a99efbfc7dc8fd8c1cd4c4eb | refs/heads/master | 2023-01-06T22:31:37.388286 | 2020-05-28T18:24:23 | 2020-05-28T18:24:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,998 | cc | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/omnibox/common/omnibox_features.h"
#include "build/build_config.h"
namespace omnibox {
// Allows Omnibox to dynamically adjust number of offered suggestions to fill in
// the space between Omnibox an the soft keyboard. The number of suggestions
// shown will be no less than minimum for the platform (eg. 5 for Android).
const base::Feature kAdaptiveSuggestionsCount{
"OmniboxAdaptiveSuggestionsCount", base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to hide the scheme from steady state URLs displayed in the
// toolbar. It is restored during editing.
const base::Feature kHideFileUrlScheme {
"OmniboxUIExperimentHideFileUrlScheme",
// Android and iOS don't have the File security chip, and therefore still
// need to show the file scheme.
#if defined(OS_ANDROID) || defined(OS_IOS)
base::FEATURE_DISABLED_BY_DEFAULT
#else
base::FEATURE_ENABLED_BY_DEFAULT
#endif
};
// Feature used to hide the scheme from steady state URLs displayed in the
// toolbar. It is restored during editing.
const base::Feature kHideSteadyStateUrlScheme{
"OmniboxUIExperimentHideSteadyStateUrlScheme",
base::FEATURE_ENABLED_BY_DEFAULT};
// Feature used to hide trivial subdomains from steady state URLs displayed in
// the toolbar. It is restored during editing.
const base::Feature kHideSteadyStateUrlTrivialSubdomains{
"OmniboxUIExperimentHideSteadyStateUrlTrivialSubdomains",
base::FEATURE_ENABLED_BY_DEFAULT};
// Feature used to hide the path, query and ref from steady state URLs
// displayed in the toolbar. It is restored during editing.
const base::Feature kHideSteadyStateUrlPathQueryAndRef {
"OmniboxUIExperimentHideSteadyStateUrlPathQueryAndRef",
#if defined(OS_IOS)
base::FEATURE_ENABLED_BY_DEFAULT
#else
base::FEATURE_DISABLED_BY_DEFAULT
#endif
};
// Feature used to enable local entity suggestions. Similar to rich entities but
// but location specific. E.g., typing 'starbucks near' could display the local
// entity suggestion 'starbucks near disneyland \n starbucks * Anaheim, CA'.
const base::Feature kOmniboxLocalEntitySuggestions{
"OmniboxLocalEntitySuggestions", base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to enable swapping the rows on answers.
const base::Feature kOmniboxReverseAnswers{"OmniboxReverseAnswers",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to enable matching short words to bookmarks for suggestions.
const base::Feature kOmniboxShortBookmarkSuggestions{
"OmniboxShortBookmarkSuggestions", base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to force on the experiment of transmission of tail suggestions
// from GWS to this client, currently testing for desktop.
const base::Feature kOmniboxTailSuggestions{
"OmniboxTailSuggestions", base::FEATURE_DISABLED_BY_DEFAULT};
// Feature that enables the tab-switch suggestions corresponding to an open
// tab, for a button or dedicated suggestion. Enabled by default on Desktop
// and iOS.
const base::Feature kOmniboxTabSwitchSuggestions{
"OmniboxTabSwitchSuggestions",
#if defined(OS_ANDROID)
base::FEATURE_DISABLED_BY_DEFAULT
#else
base::FEATURE_ENABLED_BY_DEFAULT
#endif
};
// Feature that enables tab-switch suggestions in their own row.
const base::Feature kOmniboxTabSwitchSuggestionsDedicatedRow{
"OmniboxTabSwitchSuggestionsDedicatedRow",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to enable various experiments on keyword mode, UI and
// suggestions.
const base::Feature kExperimentalKeywordMode{"OmniboxExperimentalKeywordMode",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to enable Pedal suggestions.
const base::Feature kOmniboxPedalSuggestions{"OmniboxPedalSuggestions",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature to enable clipboard provider to suggest searching for copied images.
const base::Feature kEnableClipboardProviderImageSuggestions{
"OmniboxEnableClipboardProviderImageSuggestions",
#if defined(OS_IOS)
base::FEATURE_ENABLED_BY_DEFAULT
#else
base::FEATURE_DISABLED_BY_DEFAULT
#endif
};
// Feature to enable the search provider to send a request to the suggest
// server on focus. This allows the suggest server to warm up, by, for
// example, loading per-user models into memory. Having a per-user model
// in memory allows the suggest server to respond more quickly with
// personalized suggestions as the user types.
const base::Feature kSearchProviderWarmUpOnFocus{
"OmniboxWarmUpSearchProviderOnFocus",
#if defined(OS_IOS)
base::FEATURE_DISABLED_BY_DEFAULT
#else
base::FEATURE_ENABLED_BY_DEFAULT
#endif
};
// Feature used to display the title of the current URL match.
const base::Feature kDisplayTitleForCurrentUrl{
"OmniboxDisplayTitleForCurrentUrl",
#if !defined(OS_IOS)
base::FEATURE_ENABLED_BY_DEFAULT
#else
base::FEATURE_DISABLED_BY_DEFAULT
#endif
};
// Feature used to display the search terms instead of the URL in the Omnibox
// when the user is on the search results page of the default search provider.
const base::Feature kQueryInOmnibox{"QueryInOmnibox",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to always swap the title and URL.
const base::Feature kUIExperimentSwapTitleAndUrl{
"OmniboxUIExperimentSwapTitleAndUrl",
#if defined(OS_IOS) || defined(OS_ANDROID)
base::FEATURE_DISABLED_BY_DEFAULT
#else
base::FEATURE_ENABLED_BY_DEFAULT
#endif
};
// Feature used to enable speculatively starting a service worker associated
// with the destination of the default match when the user's input looks like a
// query.
const base::Feature kSpeculativeServiceWorkerStartOnQueryInput{
"OmniboxSpeculativeServiceWorkerStartOnQueryInput",
base::FEATURE_ENABLED_BY_DEFAULT
};
// Feature used to fetch document suggestions.
const base::Feature kDocumentProvider{"OmniboxDocumentProvider",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to autocomplete bookmark, history, and document suggestions when
// the user input is a prefix of their titles, as opposed to their URLs.
const base::Feature kAutocompleteTitles{"OmniboxAutocompleteTitles",
base::FEATURE_DISABLED_BY_DEFAULT};
// Returns whether IsInstantExtendedAPIEnabled should be ignored when deciding
// the number of Google-provided search suggestions.
const base::Feature kOmniboxDisableInstantExtendedLimit{
"OmniboxDisableInstantExtendedLimit",
#if defined(OS_ANDROID)
base::FEATURE_ENABLED_BY_DEFAULT
#else
base::FEATURE_DISABLED_BY_DEFAULT
#endif
};
// Show the search engine logo in the omnibox on Android (desktop already does
// this).
const base::Feature kOmniboxSearchEngineLogo{"OmniboxSearchEngineLogo",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to allow users to remove suggestions from clipboard.
const base::Feature kOmniboxRemoveSuggestionsFromClipboard{
"OmniboxRemoveSuggestionsFromClipboard",
#if defined(OS_ANDROID)
base::FEATURE_ENABLED_BY_DEFAULT
#else
base::FEATURE_DISABLED_BY_DEFAULT
#endif
};
// Feature to debounce drive requests from the document provider.
const base::Feature kDebounceDocumentProvider{
"OmniboxDebounceDocumentProvider", base::FEATURE_DISABLED_BY_DEFAULT};
// Preserves the default match against change when providers return results
// asynchronously. This prevents the default match from changing after the user
// finishes typing. Without this feature, if the default match is updated right
// when the user presses Enter, the user may go to a surprising destination.
const base::Feature kOmniboxPreserveDefaultMatchAgainstAsyncUpdate{
"OmniboxPreserveDefaultMatchAgainstAsyncUpdate",
base::FEATURE_ENABLED_BY_DEFAULT};
// Demotes the relevance scores when comparing suggestions based on the
// suggestion's |AutocompleteMatchType| and the user's |PageClassification|.
// This feature's main job is to contain the DemoteByType parameter.
const base::Feature kOmniboxDemoteByType{"OmniboxDemoteByType",
base::FEATURE_DISABLED_BY_DEFAULT};
// A special flag, enabled by default, that can be used to disable all new
// search features (e.g. zero suggest).
const base::Feature kNewSearchFeatures{"OmniboxNewSearchFeatures",
base::FEATURE_ENABLED_BY_DEFAULT};
// Feature used to cap max zero suggestions shown according to the param
// OmniboxMaxZeroSuggestMatches. If omitted,
// OmniboxUIExperimentMaxAutocompleteMatches will be used instead. If present,
// OmniboxMaxZeroSuggestMatches will override
// OmniboxUIExperimentMaxAutocompleteMatches when |from_omnibox_focus| is true.
const base::Feature kMaxZeroSuggestMatches{"OmniboxMaxZeroSuggestMatches",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to cap max suggestions shown according to the params
// UIMaxAutocompleteMatches and UIMaxAutocompleteMatchesByProvider.
const base::Feature kUIExperimentMaxAutocompleteMatches{
"OmniboxUIExperimentMaxAutocompleteMatches",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature used to cap the number of URL-type matches shown within the
// Omnibox. If enabled, the number of URL-type matches is limited (unless
// there are no more non-URL matches available.) If enabled, there is a
// companion parameter - OmniboxMaxURLMatches - which specifies the maximum
// desired number of URL-type matches.
const bool kOmniboxMaxURLMatchesEnabledByDefault =
#if defined(OS_IOS) || defined(OS_ANDROID)
false;
#else
true;
#endif
const base::Feature kOmniboxMaxURLMatches{
"OmniboxMaxURLMatches", kOmniboxMaxURLMatchesEnabledByDefault
? base::FEATURE_ENABLED_BY_DEFAULT
: base::FEATURE_DISABLED_BY_DEFAULT};
// Feature that configures ZeroSuggestProvider using the "ZeroSuggestVariant"
// per-page-classification parameter.
//
// Generally speaking - do NOT use this for future server-side experiments.
// Instead, create your a new narrowly scoped base::Feature for each experiment.
//
// Because our Field Trial system can only configure this base::Feature in a
// single study, and does not merge parameters, using this creates conflicts.
const base::Feature kOnFocusSuggestions{"OmniboxOnFocusSuggestions",
base::FEATURE_ENABLED_BY_DEFAULT};
// Enables on-focus suggestions on the Open Web, that are contextual to the
// current URL. Will only work if user is signed-in and syncing, or is
// otherwise eligible to send the current page URL to the suggest server.
const base::Feature kOnFocusSuggestionsContextualWeb{
"OmniboxOnFocusSuggestionsContextualWeb",
base::FEATURE_DISABLED_BY_DEFAULT};
// Enables Proactive ZeroSuggestions (PZPS) on the NTP, for the Omnibox and
// Realbox respectively. Note: enabling this feature merely makes
// ZeroSuggestProvider send the request. There are additional requirements,
// like the user being signed-in, and the suggest server having PZPS enabled.
const base::Feature kProactiveZeroSuggestionsOnNTPOmnibox{
"OmniboxProactiveZeroSuggestionsOnNTPOmnibox",
base::FEATURE_DISABLED_BY_DEFAULT};
const base::Feature kProactiveZeroSuggestionsOnNTPRealbox{
"OmniboxProactiveZeroSuggestionsOnNTPRealbox",
base::FEATURE_DISABLED_BY_DEFAULT};
// Allow suggestions to be shown to the user on the New Tab Page upon focusing
// URL bar (the omnibox).
const base::Feature kZeroSuggestionsOnNTP{"OmniboxZeroSuggestionsOnNTP",
base::FEATURE_DISABLED_BY_DEFAULT};
// Allow suggestions to be shown to the user on the New Tab Page upon focusing
// the real search box.
const base::Feature kZeroSuggestionsOnNTPRealbox{
"OmniboxZeroSuggestionsOnNTPRealbox", base::FEATURE_DISABLED_BY_DEFAULT};
// Allow on-focus query refinements to be shown on the default SERP.
const base::Feature kZeroSuggestionsOnSERP{"OmniboxZeroSuggestionsOnSERP",
base::FEATURE_ENABLED_BY_DEFAULT};
// Features to provide non personalized head search suggestion from a compact
// on device model. More specifically, feature name with suffix Incognito /
// NonIncognito will only controls behaviors under incognito / non-incognito
// mode respectively.
const base::Feature kOnDeviceHeadProviderIncognito{
"OmniboxOnDeviceHeadProviderIncognito", base::FEATURE_DISABLED_BY_DEFAULT};
const base::Feature kOnDeviceHeadProviderNonIncognito{
"OmniboxOnDeviceHeadProviderNonIncognito",
base::FEATURE_DISABLED_BY_DEFAULT};
// If enabled, changes the way Google-provided search suggestions are scored by
// the backend. Note that this Feature is only used for triggering a server-
// side experiment config that will send experiment IDs to the backend. It is
// not referred to in any of the Chromium code.
const base::Feature kOmniboxExperimentalSuggestScoring{
"OmniboxExperimentalSuggestScoring", base::FEATURE_DISABLED_BY_DEFAULT};
// If disabled, terms with no wordstart matches disqualify the suggestion unless
// they occur in the URL host. If enabled, terms with no wordstart matches are
// allowed but not scored. E.g., both inputs 'java script' and 'java cript' will
// match a suggestion titled 'javascript' and score equivalently.
const base::Feature kHistoryQuickProviderAllowButDoNotScoreMidwordTerms{
"OmniboxHistoryQuickProviderAllowButDoNotScoreMidwordTerms",
base::FEATURE_DISABLED_BY_DEFAULT};
// If disabled, midword matches are ignored except in the URL host, and input
// terms with no wordstart matches are scored 0, resulting in an overall score
// of 0. If enabled, midword matches are allowed and scored when they begin
// immediately after the previous match ends. E.g. 'java script' will match a
// suggestion titled 'javascript' but the input 'java cript' won't.
const base::Feature kHistoryQuickProviderAllowMidwordContinuations{
"OmniboxHistoryQuickProviderAllowMidwordContinuations",
base::FEATURE_DISABLED_BY_DEFAULT};
// If enabled, shows slightly more compact suggestions, allowing the
// kAdaptiveSuggestionsCount feature to fit more suggestions on screen.
const base::Feature kCompactSuggestions{"OmniboxCompactSuggestions",
base::FEATURE_DISABLED_BY_DEFAULT};
// If enabled, defers keyboard popup when user highlights the omnibox until
// the user taps the Omnibox again.
extern const base::Feature kDeferredKeyboardPopup{
"OmniboxDeferredKeyboardPopup", base::FEATURE_DISABLED_BY_DEFAULT};
// If enabled, expands autocompletion to possibly (depending on params) include
// suggestion titles and non-prefixes as opposed to be restricted to URL
// prefixes. Will also adjust the location bar UI and omnibox text selection to
// accommodate the autocompletions.
const base::Feature kRichAutocompletion{"OmniboxRichAutocompletion",
base::FEATURE_DISABLED_BY_DEFAULT};
// Feature that enables not counting submatches towards the maximum
// suggestion limit.
const base::Feature kOmniboxLooseMaxLimitOnDedicatedRows{
"OmniboxLooseMaxLimitOnDedicatedRows", base::FEATURE_DISABLED_BY_DEFAULT};
// Feature that puts a single row of buttons on suggestions with actionable
// elements like keywords, tab-switch buttons, and Pedals.
const base::Feature kOmniboxSuggestionButtonRow{
"OmniboxSuggestionButtonRow", base::FEATURE_DISABLED_BY_DEFAULT};
// Enables using an Android RecyclerView to render the suggestions dropdown
// instead of a ListView.
const base::Feature kOmniboxSuggestionsRecyclerView{
"OmniboxSuggestionsRecyclerView", base::FEATURE_DISABLED_BY_DEFAULT};
// Allows long Omnibox suggestions to wrap around to next line.
const base::Feature kOmniboxSuggestionsWrapAround{
"OmniboxSuggestionsWrapAround", base::FEATURE_DISABLED_BY_DEFAULT};
// If enabled, uses WebUI to render the omnibox suggestions popup, similar to
// how the NTP "fakebox" is implemented.
const base::Feature kWebUIOmniboxPopup{"WebUIOmniboxPopup",
base::FEATURE_DISABLED_BY_DEFAULT};
// When enabled, use Assistant for omnibox voice query recognition instead of
// Android's built-in voice recognition service. Only works on Android.
const base::Feature kOmniboxAssistantVoiceSearch{
"OmniboxAssistantVoiceSearch", base::FEATURE_DISABLED_BY_DEFAULT};
// When enabled, provides an omnibox context menu option that prevents URL
// elisions.
const base::Feature kOmniboxContextMenuShowFullUrls{
"OmniboxContextMenuShowFullUrls", base::FEATURE_DISABLED_BY_DEFAULT};
} // namespace omnibox
| [
"[email protected]"
] | |
7b4f9d04098d45c78028e60b4dce3894f976405d | 6aeccfb60568a360d2d143e0271f0def40747d73 | /sandbox/SOC/2011/simd/libs/simd/mini_nt2/nt2/include/constants/eps_related.hpp | 4c6c82567432698aaf5681e0c840957770bcc788 | [] | no_license | ttyang/sandbox | 1066b324a13813cb1113beca75cdaf518e952276 | e1d6fde18ced644bb63e231829b2fe0664e51fac | refs/heads/trunk | 2021-01-19T17:17:47.452557 | 2013-06-07T14:19:55 | 2013-06-07T14:19:55 | 13,488,698 | 1 | 3 | null | 2023-03-20T11:52:19 | 2013-10-11T03:08:51 | C++ | UTF-8 | C++ | false | false | 185 | hpp | #ifndef NT2_INCLUDE_CONSTANTS_EPS_RELATED_HPP_INCLUDED
#define NT2_INCLUDE_CONSTANTS_EPS_RELATED_HPP_INCLUDED
#include <nt2/toolbox/constant/include/constants/eps_related.hpp>
#endif
| [
"[email protected]"
] | |
1ceab5827a70adf5b7d563c94fe057ac2172b4fe | 297497957c531d81ba286bc91253fbbb78b4d8be | /third_party/aom/test/decode_api_test.cc | 57df634644d1965efbb0dbb1664fd5aba603b5dc | [
"LicenseRef-scancode-unknown-license-reference",
"BSD-2-Clause"
] | permissive | marco-c/gecko-dev-comments-removed | 7a9dd34045b07e6b22f0c636c0a836b9e639f9d3 | 61942784fb157763e65608e5a29b3729b0aa66fa | refs/heads/master | 2023-08-09T18:55:25.895853 | 2023-08-01T00:40:39 | 2023-08-01T00:40:39 | 211,297,481 | 0 | 0 | NOASSERTION | 2019-09-29T01:27:49 | 2019-09-27T10:44:24 | C++ | UTF-8 | C++ | false | false | 1,495 | cc |
#include "third_party/googletest/src/googletest/include/gtest/gtest.h"
#include "config/aom_config.h"
#include "test/util.h"
#include "aom/aomdx.h"
#include "aom/aom_decoder.h"
namespace {
TEST(DecodeAPI, InvalidParams) {
static const aom_codec_iface_t *kCodecs[] = {
#if CONFIG_AV1_DECODER
aom_codec_av1_dx(),
#endif
};
uint8_t buf[1] = { 0 };
aom_codec_ctx_t dec;
EXPECT_EQ(AOM_CODEC_INVALID_PARAM, aom_codec_dec_init(NULL, NULL, NULL, 0));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM, aom_codec_dec_init(&dec, NULL, NULL, 0));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM, aom_codec_decode(NULL, NULL, 0, NULL));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM, aom_codec_decode(NULL, buf, 0, NULL));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM,
aom_codec_decode(NULL, buf, NELEMENTS(buf), NULL));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM,
aom_codec_decode(NULL, NULL, NELEMENTS(buf), NULL));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM, aom_codec_destroy(NULL));
EXPECT_TRUE(aom_codec_error(NULL) != NULL);
for (int i = 0; i < NELEMENTS(kCodecs); ++i) {
EXPECT_EQ(AOM_CODEC_INVALID_PARAM,
aom_codec_dec_init(NULL, kCodecs[i], NULL, 0));
EXPECT_EQ(AOM_CODEC_OK, aom_codec_dec_init(&dec, kCodecs[i], NULL, 0));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM,
aom_codec_decode(&dec, NULL, NELEMENTS(buf), NULL));
EXPECT_EQ(AOM_CODEC_INVALID_PARAM, aom_codec_decode(&dec, buf, 0, NULL));
EXPECT_EQ(AOM_CODEC_OK, aom_codec_destroy(&dec));
}
}
}
| [
"[email protected]"
] | |
7070cc477d92c7681b725e465ba6f6e6e7f13add | 775acebaa6559bb12365c930330a62365afb0d98 | /source/sdksamples/gotolasttextedit/IGTTxtEdtUtils.h | 94df381a12a98ef4dabcfb5b47babba9c530bce1 | [] | no_license | Al-ain-Developers/indesing_plugin | 3d22c32d3d547fa3a4b1fc469498de57643e9ee3 | 36a09796b390e28afea25456b5d61597b20de850 | refs/heads/main | 2023-08-14T13:34:47.867890 | 2021-10-05T07:57:35 | 2021-10-05T07:57:35 | 339,970,603 | 1 | 1 | null | 2021-10-05T07:57:36 | 2021-02-18T07:33:40 | C++ | UTF-8 | C++ | false | false | 1,584 | h | //========================================================================================
//
// $File: //depot/devtech/16.0.x/plugin/source/sdksamples/gotolasttextedit/IGTTxtEdtUtils.h $
//
// Owner: Adobe Developer Technologies
//
// $Author: pmbuilder $
//
// $DateTime: 2020/11/06 13:08:29 $
//
// $Revision: #2 $
//
// $Change: 1088580 $
//
// Copyright 1997-2010 Adobe Systems Incorporated. All rights reserved.
//
// NOTICE: Adobe permits you to use, modify, and distribute this file in accordance
// with the terms of the Adobe license agreement accompanying it. If you have received
// this file from a source other than Adobe, then your use, modification, or
// distribution of it requires the prior written permission of Adobe.
//
//========================================================================================
#ifndef _IGTTxtEdtUtils_
#define _IGTTxtEdtUtils_
#include "GTTxtEdtID.h"
class ISelectionManager;
/** Utility interface for the GoToText plugin
@ingroup gotolasttextedit
*/
class IGTTxtEdtUtils : public IPMUnknown
{
public:
/** kDefaultIID */
enum { kDefaultIID = IID_IGTTXTEDTUTILS };
/**
Activates the specified story, placing the text caret at the specified edit point.
@param pSelectionManager IN the selection manager.
@param storyUIDRef IN the story to be activated.
@param storyIndex IN the index at which the story is to be activated.
*/
virtual void ActivateStory(ISelectionManager* pSelectionManager, UIDRef storyUIDRef, int32 storyIndex=0) = 0;
};
#endif // _IGTTxtEdtUtils_
| [
"[email protected]"
] | |
1719f6b99f1aff9a2e70af7e699c5e7b6fefca4d | 6694e0f5fc41ce0aea00a74f69d1c73447088b73 | /PR4_Banking/Saving_Account.h | 36da073999b8716256e6577dd6f3a88b770411aa | [] | no_license | enerelt21/Banking | 70bf955a3c8821fc5bdde017538c3747d9c76035 | eea0e181ed95b92c551647b34a05e579548792c8 | refs/heads/master | 2021-04-15T09:43:06.820137 | 2018-03-24T04:04:58 | 2018-03-24T04:04:58 | 126,416,130 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 584 | h | #ifndef SAVING_ACCOUNT_H
#define SAVING_ACCOUNT_H
#include <iostream>
#include <string>
#include "Account.h"
class Saving_Account : public Account
{
private:
double interest = 4.5;
public:
//constructor
Saving_Account(Customer* cust, int account_id) : Account(cust, account_id) {}
//destructor
~Saving_Account() {}
void add_interest()
{
Account::add_interest(interest);
}
std::string to_string() {
std::string s = Account::to_string();
std::stringstream ss;
ss << "Account type: Saving" << std::endl;
return s + ss.str();
}
};
#endif | [
"[email protected]"
] | |
4f617d1a7368aee5e091f343751c24cc52f80796 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir7942/dir8062/dir8063/dir12766/dir12767/dir13029/dir13714/dir14735/file14818.cpp | 5d3d12d505fb8587fe2dca4a7aa76019fd9febe3 | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | #ifndef file14818
#error "macro file14818 must be defined"
#endif
static const char* file14818String = "file14818"; | [
"[email protected]"
] | |
5fcd8a3374ec9f569544647bc616d1c212277e25 | 313bb78d5b0ee1935099fd693ecd1016f65abb9d | /source/SetTransparency/SetTransparency.cpp | c096259ce5d9af235d05419d78e0c2645015eed0 | [] | no_license | kaida-kaida/settransparency | 915acef6c100d129a6c3b7428b0bb67de299efa9 | 18f11b2e24dad3e642c70c109c9a2ccadbcdf838 | refs/heads/master | 2021-01-11T14:12:18.549999 | 2014-03-29T09:11:59 | 2014-03-29T09:11:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,301 | cpp | // SetTransparency.cpp : Defines the entry point for the application.
//
#include "stdafx.h"
#include "SetTransparency.h"
#include <string>
using namespace std;
HWND hWnd_main = NULL;
DWORD g_pid = 0;
BYTE g_alpha = 0;
wstring g_app_title = wstring(L"");
wregex g_pattern_title;
BOOL CALLBACK EnumWindowsProc(
_In_ HWND hwnd,
_In_ LPARAM lParam
)
{
DWORD pid;
DWORD result;
result = GetWindowThreadProcessId(hwnd, &pid);
// Match PID
if (pid == g_pid)
{
hWnd_main = hwnd;
wchar_t buffer[MAXBYTE] = {0};
GetWindowTextW(hwnd, buffer, MAXBYTE);
wstring titleStr = wstring(buffer);
// Match main window title
if (regex_match(titleStr, g_pattern_title))
{
//MessageBox(NULL, _T("OK"), _T("OK"), MB_OK);
if (IsWindow(hwnd))
{
LONG winLong = GetWindowLong(hwnd, GWL_EXSTYLE);
winLong |= WS_EX_LAYERED;
SetWindowLong(hwnd, GWL_EXSTYLE, winLong);
SetLayeredWindowAttributes(hwnd, 0, g_alpha, LWA_ALPHA);
}
}
}
return TRUE;
}
int APIENTRY _tWinMain(_In_ HINSTANCE hInstance,
_In_opt_ HINSTANCE hPrevInstance,
_In_ LPTSTR lpCmdLine,
_In_ int nCmdShow)
{
UNREFERENCED_PARAMETER(hPrevInstance);
UNREFERENCED_PARAMETER(lpCmdLine);
wstring parametersStr = wstring(lpCmdLine);
wstring parPid = wstring(L"");
wstring parAlpha = wstring(L"");
wstring parAppTitle = wstring(L"");
// Parser the input as 3 parameters
wregex par_pattern(L"(\\S+)\\s+(\\S+)\\s+(.*)", regex_constants::ECMAScript);
if (regex_match(parametersStr, par_pattern))
{
parPid = regex_replace(parametersStr, par_pattern, wstring(L"$1"));
parAlpha = regex_replace(parametersStr, par_pattern, wstring(L"$2"));
parAppTitle = regex_replace(parametersStr, par_pattern, wstring(L"$3"));
}
if ( (!parPid.empty()) && (!parAlpha.empty()) && (!parAppTitle.empty()) )
{
//MessageBox(NULL, _T("OK"), _T("OK"), MB_OK);
g_pid = stoul(parPid, nullptr);
g_alpha = static_cast<BYTE>(stoul(parAlpha, nullptr));
g_app_title = parAppTitle;
g_pattern_title = wregex(wstring(L".*") + g_app_title + wstring(L".*"), regex_constants::ECMAScript);
// Validate the process
if (OpenProcess(PROCESS_QUERY_INFORMATION, 0, g_pid) != NULL)
{
EnumWindows(EnumWindowsProc, NULL);
}
}
return 0;
}
| [
"[email protected]"
] | |
a21ddb1be28ddc8c5ab0ae911830d60d2b45c48a | d8c6bd6d6caf88398169bfdf55dc9b49661c65cc | /proj5/server.cpp | d60c356cd6a9c9642c643cc254ad74b7d4124153 | [] | no_license | KendallWeihe/PrimitiveCloudServer | 99bacfa35a2bf7efd7db16ea4fbde06997f66a48 | 412d4de19890015c1617af71efafd73236ba21e5 | refs/heads/master | 2020-06-17T15:48:01.177295 | 2016-12-02T04:24:41 | 2016-12-02T04:24:41 | 74,990,735 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,397 | cpp | extern "C" {
#include "csapp.h"
}
#include <iostream>
#include <string>
#include <netinet/in.h>
#include <fstream>
#include <vector>
using namespace std;
// function declarations
unsigned int convert_header_to_host_order(char client_message[]);
void get(char buf[], int connfd);
void put(char buf[], int connfd);
void del(char buf[], int connfd);
void list(char buf[], int connfd);
void parse_filename(char buf[], char filename[]);
void parse_filedata(char buf[], char filename[]);
int search(vector<string>, string);
vector<string> file_names;
vector<string> file_data;
int rio_error_check = 0;
const int PUT_REPLY_LEN = 4;
const int DELETE_REPLY_LEN = 4;
/*
function: main()
inputs:
port number
secret key
purpose:
accept TCP connection from server
read data from client connection
parse data based on MyCloud Protocol
respond to client request
*/
int main(int argc, char* argv[]){
// socket data
int listenfd, connfd, port;
socklen_t clientlen;
struct sockaddr_in clientaddr;
struct hostent *hp;
char *haddrp;
// check for argument count
if (argc != 3) {
fprintf(stderr, "usage: %s <port> <key>\n", argv[0]);
exit(0);
}
// user defined port
port = atoi(argv[1]);
// open connection on user defined port
listenfd = Open_listenfd(port);
// loop until user enters Ctrl-C to quit
while (1){
clientlen = sizeof(clientaddr);
// accept connection with client
connfd = Accept(listenfd, (SA *)&clientaddr, &clientlen);
/* Determine the domain name and IP address of the client */
hp = Gethostbyaddr((const char *)&clientaddr.sin_addr.s_addr,
sizeof(clientaddr.sin_addr.s_addr), AF_INET);
haddrp = inet_ntoa(clientaddr.sin_addr);
printf("server connected to %s (%s)\n", hp->h_name, haddrp);
// data required to start reading from client
char buf[MAXLINE] = {0};
rio_t rio;
size_t n;
Rio_readinitb(&rio, connfd);
// read from client connection
n = Rio_readnb(&rio, buf, MAXLINE);
if (n < 0){
cout << "Error in reading from client" << endl;
rio_error_check = -1;
}
// assign secret key to local variable
char secret_key_char_array[4];
for (int i = 0; i < 4; i++){
secret_key_char_array[i] = buf[i];
}
// assign type to local variable
char type_char_array[4];
for (int i = 0; i < 4; i++){
type_char_array[i] = buf[4+i];
}
// call function to convert header to little endian order
unsigned int key = convert_header_to_host_order(secret_key_char_array);
cout << "Secret Key = " << key << endl;
// check if client key matches the server secret key
if (key != (unsigned int)stoi(argv[2])){
cout << "Invalid key" << endl; // case where the keys do not match
}
else {
// convert the type to little endian order
unsigned int type = convert_header_to_host_order(type_char_array);
cout << "Request Type = " << type << endl;
// switch statement to call function based on client specified type
switch(type){
case 0: get(buf, connfd); break;
case 1: put(buf, connfd); break;
case 2: del(buf, connfd); break;
case 3: list(buf, connfd); break;
}
}
cout << "--------------------------" << endl;
Close(connfd);
}
return 0;
}
/*
function convert_header_to_host_order()
inputs:
char array of 4 bytes
purpose:
convert char array of 4 bytes from network to host order
*/
unsigned int convert_header_to_host_order(char client_message[]){
// local variables
unsigned int byte1, byte2, byte3, byte4;
byte1 = (unsigned char)client_message[3] << 24; // bit level operations
byte2 = (unsigned char)client_message[2] << 16;
byte3 = (unsigned char)client_message[1] << 8;
byte4 = (unsigned char)client_message[0];
// cout << byte1 << ", " << byte2 << ", " << byte3 << ", " << byte4 << endl;
unsigned int header = byte1 | byte2 | byte3 | byte4;
return header;
}
/*
function parse_filename()
inputs:
buffer of data from client
empty char array to store filename
purpose:
extract filename from buffer read from client
*/
void parse_filename(char buf[], char filename[]){
// note the filename begins at byte number 9 (i = 8)
for (int i = 8; i < 88; i++){
if (buf[i] == '\0'){ // case where the end of the file is found
break;
}
filename[i-8] = buf[i];
}
cout << "Filename = " << filename << endl;
}
/*
function parse_filedata()
inputs:
buffer of data from client
empty char array to store file data
purpose:
extract file data from buffer read from client
*/
void parse_filedata(char buf[], char filedata[]){
// the length of the file starts at 88 and ends at 91
unsigned char byte_1 = buf[91];
unsigned char byte_2 = buf[90];
unsigned char byte_3 = buf[89];
unsigned char byte_4 = buf[88];
unsigned int a = (unsigned int)byte_1 << 24; // bit level operations
unsigned int b = (unsigned int)byte_2 << 16;
unsigned int c = (unsigned int)byte_3 << 8;
unsigned int d = (unsigned int)byte_4;
unsigned int file_length = a | b | c | d;
// note the filedata begins at byte number 93 (i = 92)
for (unsigned int i = 92; i < 92 + file_length; i++){
if (buf[i] == '\0'){ // case where the end of the file is found
break;
}
filedata[i-92] = buf[i];
}
}
/*
function get()
inputs:
buffer of data from client
client connection file descriptor
purpose:
read a file
send file data back to client
*/
void get(char buf[], int connfd){
// get filename from buffer
char filename[80] = {0};
parse_filename(buf, filename);
bool file_exists = false;
string file;
int error = 0;
for (unsigned int i = 0; i < file_names.size(); i++){
if (file_names[i] == filename){
file = file_data[i];
file_exists = true;
}
}
if (!file_exists){
error = -1;
}
// read the data from the file
char return_buf[MAXLINE] = {0};
unsigned int index;
for (index = 8; index < file.length()+8; index++){
return_buf[index] = file[index-8];
}
// error bytes
if (error < 0 || rio_error_check < 0){
return_buf[0] = -1;
cout << "Operation status = error" << endl;
}
else{
return_buf[0] = 0;
cout << "Operation status = success" << endl;
}
return_buf[1] = 0;
return_buf[2] = 0;
return_buf[3] = 0;
// bytes 4-8 are the file size (number of bytes)
return_buf[4] = (index - 8) & 0xff;
return_buf[5] = ((index - 8) >> 8) & 0xff;
return_buf[6] = ((index - 8) >> 16) & 0xff;
return_buf[7] = ((index - 8) >> 24) & 0xff;
// UNCOMMENT TO CHECK FILE SIZE
// cout << "Index = " << index << endl;
// cout << "Byte 1 = " << (unsigned int)return_buf[4] << endl;
// cout << "Byte 2 = " << (unsigned int)return_buf[5] << endl;
// cout << "Byte 3 = " << (unsigned int)return_buf[6] << endl;
// cout << "Byte 4 = " << (unsigned int)return_buf[7] << endl;
const unsigned int BUF_LENGTH = index;
Rio_writen(connfd, return_buf, BUF_LENGTH);
}
/*
function put()
inputs:
buffer of data from client
client connection file descriptor
purpose:
store a file
send confirmation back to client
*/
void put(char buf[], int connfd){
// get filename from buffer
char filename[80] = {0};
parse_filename(buf, filename);
string fname(filename); // convert to string
char data[MAXLINE] = {0};
parse_filedata(buf, data);
string fdata(data);
int index = search( file_names, fname ); // check if the file already exists
if( index != -1 ) { // If it does, update it.
file_data[index] = fdata;
}
else { // If not, add the new variable and value.
file_names.push_back(fname);
file_data.push_back(fdata);
}
// assemble the return message
char return_buf[PUT_REPLY_LEN] = {0};
// error bytes
if (rio_error_check < 0){
return_buf[0] = -1;
rio_error_check = 0;
cout << "Operation Status = error\n";
}
else{
return_buf[0] = 0;
cout << "Operation Status = success\n";
}
return_buf[1] = 0;
return_buf[2] = 0;
return_buf[3] = 0;
// write to the client
Rio_writen(connfd, return_buf, PUT_REPLY_LEN);
}
void del(char buf[], int connfd) {
char filename[80] = {0};
parse_filename(buf, filename);
string fname(filename); // convert to string
int index = search( file_names, fname ); // check if the file exists
if( index != -1 ) { // If it does, delete it
file_names.erase(file_names.begin() + index);
file_data.erase(file_data.begin() + index);
rio_error_check = 0;
cout << "Operation Status = success" << endl;
}
else { // If the file is not stored in the server
rio_error_check = -1;
cout << "Operation Status = error" << endl;
}
// assemble the return message
char return_buf[DELETE_REPLY_LEN] = {0};
// error bytes
if (rio_error_check < 0){
return_buf[0] = -1;
}
else{
return_buf[0] = 0;
}
return_buf[1] = 0;
return_buf[2] = 0;
return_buf[3] = 0;
// write to the client
Rio_writen(connfd, return_buf, DELETE_REPLY_LEN);
}
void list(char buf[], int connfd) {
string file_list = ""; // Holds the list of files
for(unsigned int i = 0; i < file_names.size(); i++ ) {
file_list += file_names[i] + "\n";
}
char return_buf[MAXLINE] = {0};
unsigned int index;
for (index = 8; index < file_list.length()+8; index++){
return_buf[index] = file_list[index-8];
}
// error bytes
if (rio_error_check < 0){
return_buf[0] = -1;
cout << "Operation status = error" << endl;
}
else{
return_buf[0] = 0;
cout << "Operation status = success" << endl;
}
return_buf[1] = 0;
return_buf[2] = 0;
return_buf[3] = 0;
// bytes 4-8 are the file size (number of bytes)
return_buf[4] = (index - 8) & 0xff;
return_buf[5] = ((index - 8) >> 8) & 0xff;
return_buf[6] = ((index - 8) >> 16) & 0xff;
return_buf[7] = ((index - 8) >> 24) & 0xff;
const unsigned int BUF_LENGTH = index;
Rio_writen(connfd, return_buf, BUF_LENGTH);
}
int search(vector<string> vec, string toFind) {
for (unsigned int i = 0; i < vec.size(); i++) {
if (vec[i] == toFind) {
return i; // Return the position if it's found.
}
}
return -1; // If not found, return -1.
}
| [
"[email protected]"
] | |
26b7f5021acb3bd395f22f33e76094533bfd75f4 | b643341b408b090e9f83e21713e14fa8b7508a80 | /Source/artoolkit6-dependency/include/AR6/ARTrackableSquare.h | 4def59bcdab3852404f3d7e96e36172bcc597fcc | [] | no_license | ThorstenBux/artoolkit6-calibration-android | a911fdf15efd00dbba2e95f2ae654262ced9c403 | f19b3a707bb7ceef37eccb54ebd15205f1637954 | refs/heads/master | 2021-07-11T12:06:13.662950 | 2017-10-13T09:15:34 | 2017-10-13T09:15:34 | 105,212,852 | 1 | 2 | null | 2017-09-29T00:44:32 | 2017-09-29T00:44:31 | null | UTF-8 | C++ | false | false | 3,218 | h | /*
* ARTrackableSquare.h
* ARToolKit6
*
* This file is part of ARToolKit.
*
* ARToolKit is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* ARToolKit 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 Lesser General Public License
* along with ARToolKit. If not, see <http://www.gnu.org/licenses/>.
*
* As a special exception, the copyright holders of this library give you
* permission to link this library with independent modules to produce an
* executable, regardless of the license terms of these independent modules, and to
* copy and distribute the resulting executable under terms of your choice,
* provided that you also meet, for each linked independent module, the terms and
* conditions of the license of that module. An independent module is a module
* which is neither derived from nor based on this library. If you modify this
* library, you may extend this exception to your version of the library, but you
* are not obligated to do so. If you do not wish to do so, delete this exception
* statement from your version.
*
* Copyright 2015-2016 Daqri, LLC.
* Copyright 2011-2015 ARToolworks, Inc.
*
* Author(s): Julian Looser, Philip Lamb
*
*/
#ifndef ARMARKERSQUARE_H
#define ARMARKERSQUARE_H
#include <AR6/ARTrackable.h>
#define AR_PATTERN_TYPE_TEMPLATE 0
#define AR_PATTERN_TYPE_MATRIX 1
/**
* Single marker type of ARTrackable.
*/
class ARTrackableSquare : public ARTrackable {
private:
bool m_loaded;
protected:
ARPattHandle *m_arPattHandle;
ARdouble m_width;
ARdouble m_cf;
ARdouble m_cfMin;
bool unload();
public:
int patt_id; ///< Unique pattern ID provided by ARToolKit
int patt_type;
ARTrackableSquare();
~ARTrackableSquare();
bool useContPoseEstimation;
ARdouble getConfidence();
ARdouble getConfidenceCutoff();
void setConfidenceCutoff(ARdouble value);
bool initWithPatternFile(const char* path, ARdouble width, ARPattHandle *arPattHandle);
bool initWithPatternFromBuffer(const char* buffer, ARdouble width, ARPattHandle *arPattHandle);
bool initWithBarcode(int barcodeID, ARdouble width);
/**
* Updates the marker with new tracking info.
* Then calls ARTrackable::update()
* @param markerInfo Array containing detected marker information
* @param markerNum Number of items in the array
* @param ar3DHandle AR3DHandle used to extract marker pose.
*/
bool updateWithDetectedMarkers(ARMarkerInfo* markerInfo, int markerNum, AR3DHandle *ar3DHandle);
bool updateWithDetectedMarkersStereo(ARMarkerInfo* markerInfoL, int markerNumL, ARMarkerInfo* markerInfoR, int markerNumR, AR3DStereoHandle *handle, ARdouble transL2R[3][4]);
};
#endif // !ARMARKERSQUARE_H
| [
"[email protected]"
] | |
bc8917997920f1de0f1bcc31a59181d0cb1ff8a8 | 1cc1b1a94493e6962cad12f1f89e584bf0311e8f | /RemoveDuplicatesFromSortedArray.cpp | fe8aedd190f5d7f8560f1d394cd1939845df75d0 | [] | no_license | LeonXJ/leonleetcode | 26c138f8cdc46c974ae4912039949eddbc3a46aa | 42be6485cc586b1f13b08ef0f938762d3f05f009 | refs/heads/master | 2016-09-16T02:26:53.063483 | 2013-09-10T09:02:09 | 2013-09-10T09:02:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 507 | cpp | int removeDuplicates(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(!A || n==0){
return 0;
}
if(n==1){
return 1;
}
int iFirst = 0;
int iSecond = 1;
for(iSecond = 1; iSecond<n; ++iSecond){
if(A[iFirst] != A[iSecond]){
++iFirst;
A[iFirst] = A[iSecond];
}
}
return iFirst+1;
}
| [
"[email protected]"
] | |
2bf43c6e97fdb10f48d140bc1d60a8e9cd8d8fb3 | 3a3ed2c22e418467b9a54863e810116d8f3e5f0a | /src/SGIEngine/Timer.h | 92efe51c90ffcba116870adf35d1e02cac89e737 | [] | no_license | ArnauBigas/SGI-Engine | dbb96d99075fb481e12a64eef4efd7e7752fc808 | 882ed9647d9be104b5706fdeeed44946f9d16587 | refs/heads/master | 2021-05-31T13:04:32.336605 | 2016-05-06T20:22:19 | 2016-05-06T20:22:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 239 | h | #ifndef TIMER_H
#define TIMER_H
class Timer {
public:
void start();
void stop();
void reset();
unsigned long getTime();
private:
bool running;
unsigned long startms;
unsigned long ms;
};
#endif /* TIMER_H */
| [
"[email protected]"
] | |
c1f1e3066b063d06b3689ef4b438b9fa39f00b34 | 0a00b5f68d68c9648dc2bb118210512bc07ced33 | /sublime vala/declunchtime.cpp | 716c0c02128a4e4c30d246b146e7e1476afed8e7 | [] | no_license | Anugrahchaturvedi/my_code_cpp02 | 98ad9e8edcf6847ca50d558b1a640d50684b20fa | 91b4e0d23264c1f11c4033bfbdfd5c95e94fd853 | refs/heads/master | 2023-05-31T23:42:13.009480 | 2021-06-01T18:22:29 | 2021-06-01T18:22:29 | 372,919,929 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 336 | cpp | #include<bits/stdc++.h>
using namespace std ;
int main()
{
long long int t , n , k;
int sum =0 , arr[n];
//cin >> t ;
//while (t--)
//{
cin >> n >>k;
//cin >>k;
for (int i =0 ; i< n ;i++)
{
cin >>arr[i];
}
for (int i=0; i< n ; i++)
{
sum=sum + arr[i];
}
cout << "sum id "<<sum << endl;
//}
return 0;
} | [
"[email protected]"
] | |
0d9d25ccb823f77f2bdb6a009d150bc47c03325c | c0c025007b7732bc3ca309b834b2e3e210276577 | /sample/accounting_Beta2/homepage_1.h | afa14947c21c282433b463e9a411adaf536814c2 | [] | no_license | gukurhgodp31/CSharpHomework | 1d936814604084a521141f93cbfe8a4272cee7a4 | 6e5ff3787a3c992e2574acd3a9c1aad5457474a4 | refs/heads/master | 2023-04-19T19:32:42.746660 | 2021-04-13T02:57:28 | 2021-04-13T02:57:28 | 365,220,500 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 674 | h | #ifndef HOMEPAGE_1_H
#define HOMEPAGE_1_H
#include <QDialog>
#include <QtCharts>
using namespace QtCharts;
namespace Ui {
class Homepage_1;
}
class Homepage_1 : public QDialog
{
Q_OBJECT
public:
explicit Homepage_1(QWidget *parent = 0);
~Homepage_1();
QString income;
QString output;
QString remain;
QChart *progressDonut(double budget);
int password;
void list();
private slots:
void on_setBtn_clicked();
void on_pushButton_clicked();
void showProgressDonut();
void on_pushButton_3_clicked();
void change2AcountStatement();
void change2Chart();
private:
Ui::Homepage_1 *ui;
};
#endif // HOMEPAGE_1_H
| [
"[email protected]"
] | |
c50ff5c02374ef42c44345bceadfbb580319f541 | f413bf20ddbfd37c171385cf095a39392fcb4867 | /Source/Rendering/Misc/vaZoomTool.h | 3eb09ff25ce044c62a61f447c15377d0c59c40a8 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | NewKidHere/XeGTAO | be44d3c0db9688958c7088f28113d585f25c5e58 | 65b387cd2fa7dd14b1382807a6be9750ea305376 | refs/heads/master | 2023-08-13T19:32:51.044319 | 2021-09-20T17:07:18 | 2021-09-20T17:07:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,329 | h | ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2016-2021, Intel Corporation
//
// SPDX-License-Identifier: MIT
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// Author(s): Filip Strugar ([email protected])
//
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#pragma once
#include "Core/vaCoreIncludes.h"
#include "Core/vaUI.h"
#include "Rendering/vaRenderingIncludes.h"
namespace Vanilla
{
class vaInputMouseBase;
class vaZoomTool : public Vanilla::vaRenderingModule, public vaUIPanel
{
public:
struct Settings
{
bool Enabled = false;
int ZoomFactor = 4;
vaVector2i BoxPos = vaVector2i( 400, 300 );
vaVector2i BoxSize = vaVector2i( 128, 96 );
Settings( ) { }
};
protected:
shared_ptr<vaTexture> m_edgesTexture;
Settings m_settings;
vaTypedConstantBufferWrapper<ZoomToolShaderConstants>
m_constantsBuffer;
vaAutoRMI<vaComputeShader> m_CSZoomToolFloat;
vaAutoRMI<vaComputeShader> m_CSZoomToolUnorm;
public:
vaZoomTool( const vaRenderingModuleParams & params );
~vaZoomTool( );
public:
Settings & Settings( ) { return m_settings; }
void HandleMouseInputs( vaInputMouseBase & mouseInput );
virtual void Draw( vaRenderDeviceContext & renderContext, shared_ptr<vaTexture> colorInOut ); // colorInOut is not a const reference for a reason (can change if it's the current RT)
protected:
virtual void UpdateConstants( vaRenderDeviceContext & renderContext );
private:
virtual void UIPanelTickAlways( vaApplicationBase & application ) override;
virtual void UIPanelTick( vaApplicationBase & application ) override;
};
}
| [
"[email protected]"
] | |
b4edda58fa62b56b648dea082ab080f138c0bf6a | ea92cb09d832e11ea8b1e74d35326091fb6bbaa6 | /demos/d/src/ActivatingCollisionAlgorithm.h | ab0351f6c2d109eb2bc77eeffd836cbf8d53dc64 | [
"MIT"
] | permissive | DesignEngrLab/StabilityStudy | 3929b704b7365b839a64c34b6273ee1f5e637fba | 8ed7685621c76dc74816855a6cf370317fe401fb | refs/heads/master | 2021-01-16T23:03:25.276541 | 2016-10-06T23:59:23 | 2016-10-06T23:59:23 | 70,174,035 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 241 | h | #pragma once
#include "CollisionAlgorithm.h"
namespace BulletSharp
{
public ref class ActivatingCollisionAlgorithm abstract : CollisionAlgorithm
{
internal:
ActivatingCollisionAlgorithm(btActivatingCollisionAlgorithm* native);
};
};
| [
"[email protected]"
] | |
0ae5dd53148517d2642eae6cf5f0b9a370f6c33c | aab49f04e01a3f248ce5adb0d65088bc921fb380 | /1.Introduction-to-Programming-Practice/week-10/55-reverse-array-elements.cpp | b12bfb9011615133fbdfa02852393bee1b206284 | [] | no_license | gyokkoo/Introduction-to-Programming-FMI-2017 | bb8983c159cf802cf3b9b533e503a3dceaf24b4a | 6a467f894991d69c6a06cd36309b600d46e91a93 | refs/heads/master | 2023-06-14T10:27:10.622804 | 2021-07-07T16:37:41 | 2021-07-07T16:37:41 | 107,156,320 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,197 | cpp | /**
*
* Solution to exercises
* Introduction to programming course
* Faculty of Mathematics and Informatics of Sofia University
* Winter semester 2017/2018
*
* @author Gyokan Syuleymanov
* @idnumber 62117
* @task 55
* @compiler GCC
*
* Assignment:
* Да се състави програма, чрез която предварително въведени N
* естествени числа от интервала [0..5000] в едномерен масив се
* разменят местата на елементите му в обратен ред.
* Пример: 1,2,4,3,5,6,7 Изход: 7,6,5,3,4,2,1
*/
#include <iostream>
using namespace std;
const int MAX_SIZE = 1000;
int main()
{
int arr[MAX_SIZE];
int n = 0, tempElement = 0;
cout << "Enter N, and N integer numbers" << endl;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
// Reverse elements
for (int i = 0; i < n / 2; i++)
{
tempElement = arr[i];
arr[i] = arr[n - i - 1];
arr[n - i - 1] = tempElement;
}
// Print array
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
cout << endl;
return 0;
}
| [
"[email protected]"
] | |
912f25fab5805c732460a1c894012b9d8e4b0240 | d1e88b853c50997dbc16dca812fe9b0e04bbf759 | /myserver.h | 3a0242657c1aba49af67392c4501c923f2f9f2ca | [] | no_license | HelloAWorld/myserverclient | ba64690880b4fffb30b1b9de56ed433683ff573c | c639b5716fd6750a5ec16e06cc70be794e92b94d | refs/heads/master | 2021-01-05T13:21:58.686315 | 2020-02-17T06:32:26 | 2020-02-17T06:32:26 | 241,034,281 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 406 | h | #ifndef __MY_SERVER_H__
#define __MY_SERVER_H__
#include "sys/epoll.h"
#include "sys/socket.h"
#include "sys/types.h"
#include "mysocket.h"
#include <map>
class CMyServer
{
public:
CMyServer();
int create_server(int port);
int epoll_bind();
int start_loop();
int handle(int fd);
int end_loop();
private:
int m_ep_fd;
CMySocket m_serversocket;
std::map<int, CMySocket *> m_mapClients;
};
#endif
| [
"[email protected]"
] | |
8748e8bcc6c9976b8b85f5131dfb00103a39ed4a | 3bbefab6c034154ae4724baf0fe9de1eb2008d82 | /src/appleseed/foundation/meta/benchmarks/benchmark_integerdivision.cpp | c11f42b95c6e8d6e42b4fbbd089797611e4717ae | [
"MIT"
] | permissive | johnhaddon/appleseed | e959a30ab24f80a4cb3639d22c1b16b58fc3373c | 82eb4693f7a64fcaf238272a1ad62ff38c5b870b | refs/heads/master | 2021-01-22T09:32:01.704121 | 2016-08-22T17:41:23 | 2016-08-22T17:41:23 | 17,192,177 | 1 | 0 | null | 2016-08-24T12:04:18 | 2014-02-25T23:36:11 | C++ | UTF-8 | C++ | false | false | 2,531 | cpp |
//
// This source file is part of appleseed.
// Visit http://appleseedhq.net/ for additional information and resources.
//
// This software is released under the MIT license.
//
// Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited
// Copyright (c) 2014-2016 Francois Beaune, The appleseedhq Organization
//
// 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.
//
// appleseed.foundation headers.
#include "foundation/math/rng/distribution.h"
#include "foundation/math/rng/mersennetwister.h"
#include "foundation/math/scalar.h"
#include "foundation/utility/benchmark.h"
// Standard headers.
#include <cstddef>
using namespace foundation;
BENCHMARK_SUITE(IntegerDivision)
{
const size_t N = 1000;
struct Fixture
{
size_t m_num[N];
size_t m_den[N];
double m_one_over_den[N];
size_t m_result;
Fixture()
: m_result(0)
{
MersenneTwister rng;
for (size_t i = 0; i < N; ++i)
{
m_num[i] = rand_int1(rng, 0, 100);
m_den[i] = rand_int1(rng, 1, 100);
m_one_over_den[i] = 1.0 / m_den[i];
}
}
};
BENCHMARK_CASE_F(IntegerDivision, Fixture)
{
for (size_t i = 0; i < N; ++i)
m_result += m_num[i] / m_den[i];
}
BENCHMARK_CASE_F(MultiplicationByReciprocal, Fixture)
{
for (size_t i = 0; i < N; ++i)
m_result += truncate<size_t>(m_num[i] * m_one_over_den[i]);
}
}
| [
"[email protected]"
] | |
801577cd4a6c19e42b10e1fd52b7b22452a8d337 | b11b2b488d94ae20f58cfe40bae0987c32b5945e | /LEMOS-2.3.x/tutorials/mesh/movingBlockRBF/constant/turbulenceProperties | 692307c1ebe81f02be4787b6ad6407e7c379394c | [] | no_license | jamesjguthrie/mayerTestCase | 93dbd9230e16a0f061cec97c7ddf6cb5303e1c95 | 9279ad56b62efa1507ff8b1bcd96e3ce2daceb56 | refs/heads/master | 2021-03-30T18:20:33.641846 | 2019-06-25T12:55:07 | 2019-06-25T12:55:07 | 26,530,210 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 900 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.2.1 |
| \\ / A nd | Web: www.OpenFOAM.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class dictionary;
location "constant";
object turbulenceProperties;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
simulationType laminar;
// ************************************************************************* //
| [
"[email protected]"
] | ||
b43ceb5a62ae838017fbcf328f14a1469fd9bc74 | d62a7af792a62892e39a13e4d5eecc045172f5f6 | /Source/Player.cpp | 8f8e251c1b169117e0a4ef987988ed7b114b2236 | [] | no_license | MasterSofter/LunarLander | 2317985d1c12b2b664f283836bda07b85fa86d8e | d675b34767ee4747ffad8cd3ecf092455f8a5ef1 | refs/heads/master | 2020-04-23T11:18:14.174369 | 2019-02-17T14:37:09 | 2019-02-17T14:37:09 | 171,132,065 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,930 | cpp | #include "Player.h"
#include "CommandQueue.h"
#include "LunarModuleNode.h"
#include <SFML/Network/Packet.hpp>
#include <map>
#include <string>
#include <algorithm>
using namespace std::placeholders;
struct ThrustOn
{
ThrustOn(double t) {thrust = t;}
void operator() (LunarModuleNode& lunarModule, sf::Time) const {
if(!lunarModule.hasLanded())
lunarModule.setThrust(lunarModule.maxThrust() * thrust);
}
double thrust;
};
struct ThrustPlus
{
ThrustPlus(double val) { delta = val; }
void operator() (LunarModuleNode& lunarModule, sf::Time) const {
if(!lunarModule.hasLanded())
lunarModule.setThrust(lunarModule.getThrust() + lunarModule.maxThrust() * delta);
}
double delta;
};
struct TorqueRightOn
{
void operator() (LunarModuleNode& lunarModule, sf::Time) const {
if(!lunarModule.hasLanded())
lunarModule.setTorque(-1);
}
};
struct TorqueLeftOn
{
void operator() (LunarModuleNode& lunarModule, sf::Time) const {
if(!lunarModule.hasLanded())
lunarModule.setTorque(1);
}
};
struct TorqueOff
{
void operator() (LunarModuleNode& lunarModule, sf::Time) const {
lunarModule.setTorque(0);
}
};
Player::Player(const KeyBinding* binding)
: _keyBindingPtr(binding),
_currentMissionStatus(MissionRunning)
{
initializeActions();
}
void Player::handleEvent(const sf::Event& event, CommandQueue& commands)
{
// Event
if (event.type == sf::Event::KeyPressed || event.type == sf::Event::KeyReleased)
{
Action action;
if (_keyBindingPtr && _keyBindingPtr->checkAction(event, action))
commands.push(_actionBinding[action]);
}
}
void Player::handleRealtimeInput(CommandQueue& commands)
{
// Lookup all actions and push corresponding commands to queue
std::vector<Action> activeActions = _keyBindingPtr->getRealtimeActions();
for(auto& action : activeActions)
commands.push(_actionBinding[action]);
}
void Player::setMissionStatus(MissionStatus status)
{
_currentMissionStatus = status;
}
void Player::initializeActions()
{
_actionBinding[PlayerAction::ThrustOn].action = derivedAction<LunarModuleNode>(ThrustOn(1.f));
_actionBinding[PlayerAction::ThrustOff].action = derivedAction<LunarModuleNode>(ThrustOn(0.f));
_actionBinding[PlayerAction::ThrustHalf].action = derivedAction<LunarModuleNode>(ThrustOn(0.5f));
_actionBinding[PlayerAction::ThrustPlus].action = derivedAction<LunarModuleNode>(ThrustPlus(0.1f));
_actionBinding[PlayerAction::ThrustMinus].action = derivedAction<LunarModuleNode>(ThrustPlus(-0.1f));
_actionBinding[PlayerAction::TorqueRithtOn].action = derivedAction<LunarModuleNode>(TorqueRightOn());
_actionBinding[PlayerAction::TorqueLeftOn].action = derivedAction<LunarModuleNode>(TorqueLeftOn());
_actionBinding[PlayerAction::TorqueOff].action = derivedAction<LunarModuleNode>(TorqueOff());
for(auto it = _actionBinding.begin(); it != _actionBinding.end(); ++it)
it->second.category = Category::Type::SceneLunarModule;
}
| [
"[email protected]"
] | |
40babb99421c5d116731e63df88d877e99bd4615 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir521/dir522/dir572/dir2774/file3555.cpp | 06c1721f12a02022b063356031f7b4244d01c1db | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 111 | cpp | #ifndef file3555
#error "macro file3555 must be defined"
#endif
static const char* file3555String = "file3555"; | [
"[email protected]"
] | |
9174567b2421b12339f04e4ebff0df7e18b7bfc7 | e315a4322fcfb050215c24ac0e8f786138dec096 | /HW10 10.cpp | 0e088fc9892133fbdb5614bcb06625813df25154 | [] | no_license | HasaliEdirisinghe/Homework-10 | 486460d2f5b581efc67b715a18c5b11fa55189fc | 226e7198bcefca066a8bc36ffdd724624d7a400f | refs/heads/main | 2023-08-15T04:22:26.486341 | 2021-10-23T16:55:01 | 2021-10-23T16:55:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,155 | cpp | #include<iostream>
#include<string.h>
using namespace std;
// A program to merge two files and write it in a new file.
int main()
{
FILE *file1, *file2, *fnew;
char current, fname1[20], fname2[20], fname3[30];
//getting user inputs
cout << "Input the 1st file name: ";
cin >> fname1;
cout << "Input the 2nd file name: ";
cin >> fname2;
cout << "Input the new file name where to merge the above two files: ";
cin >> fname1;
//open files to read
file1 = fopen(fname1, "r");
file2 = fopen(fname2, "r");
//check for errors of existence
if(file1==NULL || file2==NULL)
{
printf(" File does not exist or error in opening...!!\n");
exit(EXIT_FAILURE);
}
//open a file to merge
fnew=fopen(fname3, "w");
//check for errors of existence
if(fnew == NULL)
{
printf(" File does not exist or error in opening...!!\n");
exit(EXIT_FAILURE);
}
//merging
while((current=fgetc(file1)) != EOF)
{
fputc(current, fnew);
}
while((current=fgetc(file2)) != EOF)
{
fputc(current, fnew);
}
//display
cout << "The two files merged into " << fname3 << " successfully...!!";
fclose(file1);
fclose(file2);
fclose(fnew);
}
| [
"[email protected]"
] | |
830a3d97f42f7ab793fca58619b7547f82cf69ce | 9fb71ba51dd38af8c22bbe06fb4dc460c8c0d7df | /src/Density/check_density_continuity_at_mt.hpp | 56a68123a0a579bcdcee8a501b015b564bc1c350 | [
"BSD-2-Clause"
] | permissive | ckae95/SIRIUS | 15e279fb24220bf10ebce0fd2a9630cdc3e2ac67 | ecb7edb4f19577c85b0cec82aa6a0d5374ee1f33 | refs/heads/master | 2021-04-09T15:50:43.754267 | 2018-03-16T15:50:06 | 2018-03-16T15:50:06 | 125,530,189 | 0 | 0 | BSD-2-Clause | 2018-03-16T14:50:45 | 2018-03-16T14:50:45 | null | UTF-8 | C++ | false | false | 1,399 | hpp | //inline void Density::check_density_continuity_at_mt()
//{
// // generate plane-wave coefficients of the potential in the interstitial region
// ctx_.fft().input(&rho_->f_it<global>(0));
// ctx_.fft().transform(-1);
// ctx_.fft().output(ctx_.num_gvec(), ctx_.fft_index(), &rho_->f_pw(0));
//
// SHT sht(ctx_.lmax_rho());
//
// double diff = 0.0;
// for (int ia = 0; ia < ctx_.num_atoms(); ia++)
// {
// for (int itp = 0; itp < sht.num_points(); itp++)
// {
// double vc[3];
// for (int x = 0; x < 3; x++) vc[x] = sht.coord(x, itp) * ctx_.atom(ia)->mt_radius();
//
// double val_it = 0.0;
// for (int ig = 0; ig < ctx_.num_gvec(); ig++)
// {
// double vgc[3];
// ctx_.get_coordinates<cartesian, reciprocal>(ctx_.gvec(ig), vgc);
// val_it += real(rho_->f_pw(ig) * exp(double_complex(0.0, Utils::scalar_product(vc, vgc))));
// }
//
// double val_mt = 0.0;
// for (int lm = 0; lm < ctx_.lmmax_rho(); lm++)
// val_mt += rho_->f_rlm(lm, ctx_.atom(ia)->num_mt_points() - 1, ia) * sht.rlm_backward(lm, itp);
//
// diff += fabs(val_it - val_mt);
// }
// }
// printf("Total and average charge difference at MT boundary : %.12f %.12f\n", diff, diff / ctx_.num_atoms() / sht.num_points());
//}
| [
"[email protected]"
] | |
ab830abee4785755c7a55b61756618cb16fb6a41 | 32e43c3cce09f4659035644e70a4e2e88b021c15 | /abc178/d.cpp | e5892337b4511934136fab5f03956b3792268644 | [] | no_license | sp4ghet/comp | 22c7453bcd4aff56970f3ee465e0c66ca0ab697f | 222911d45ab513c88d5450919d8c803cb0f7da1c | refs/heads/master | 2020-12-04T15:59:34.368399 | 2020-09-19T15:00:31 | 2020-09-19T15:00:31 | 231,827,088 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,281 | cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp = vector<vp>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
istream &operator>>(istream &is, P &a)
{
return is >> a.first >> a.second;
}
ostream &operator<<(ostream &os, const P &a) { return os << "(" << a.first << "," << a.second << ")"; }
template <typename T>
void view(const std::vector<T> &v)
{
for (const auto &e : v)
{
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T>
void view(const std::vector<std::vector<T>> &vv)
{
for (const auto &v : vv)
{
view(v);
}
}
#pragma endregion
#pragma region mod
const int p = 1e9 + 7; //10^9 + 7
struct mint
{
ll x;
mint(ll xx = 0) : x(xx % p) {}
mint &operator+=(const mint a)
{
if ((x += a.x) >= p)
x -= p;
return *this;
}
mint &operator-=(const mint a)
{
if ((x += p - a.x) >= p)
x -= p;
return *this;
}
mint &operator*=(const mint a)
{
(x *= a.x) %= p;
return *this;
}
mint operator+(const mint a) const
{
mint res(*this);
return res += a;
}
mint operator-(const mint a) const
{
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const
{
mint res(*this);
return res *= a;
}
mint pow(ll t) const
{
mint r = 1;
mint a = *this;
while (true)
{
if (t & 1)
{
r *= a;
}
t >>= 1;
if (t == 0)
break;
a *= a;
}
return r;
}
mint inv() const
{
return pow(p - 2);
}
mint &operator/=(const mint a)
{
return (*this) *= a.inv();
}
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct comb
{
vector<mint> fact, invs;
comb(int n) : fact(n + 1), invs(n + 1)
{
assert(n < p);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
invs[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
invs[i - 1] = invs[i] * i;
}
mint operator()(int n, int k)
{
if (k < 0 || k > n)
return 0;
return fact[n] * invs[n - k] * invs[k];
}
};
#pragma endregion
mint dp[2005][2005];
mint f(int x, int k)
{
if (dp[x][k].x != -1)
{
return dp[x][k];
}
if (k == 1 && x >= 3)
{
return 1;
}
mint ret = 0;
for (int j = 3; (k - 1) * 3 + j <= x; j++)
{
ret += f(x - j, k - 1);
}
return dp[x][k] = ret;
}
int main()
{
int s;
cin >> s;
int maxlen = s / 3;
mint ans = 0;
rep(i, 2005) rep(j, 2005) dp[i][j].x = -1;
for (int i = 1; i <= maxlen; i++)
{
ans += f(s, i);
}
cout << ans << endl;
return 0;
} | [
"[email protected]"
] | |
94dfa9a8b39db13f3e95f76815789cf77d194269 | 1dbf007249acad6038d2aaa1751cbde7e7842c53 | /cdn/src/v2/model/RequestLimitRules.cpp | ad5a3fbf48542d500a7708f0f3e57ed8c94a3aba | [] | permissive | huaweicloud/huaweicloud-sdk-cpp-v3 | 24fc8d93c922598376bdb7d009e12378dff5dd20 | 71674f4afbb0cd5950f880ec516cfabcde71afe4 | refs/heads/master | 2023-08-04T19:37:47.187698 | 2023-08-03T08:25:43 | 2023-08-03T08:25:43 | 324,328,641 | 11 | 10 | Apache-2.0 | 2021-06-24T07:25:26 | 2020-12-25T09:11:43 | C++ | UTF-8 | C++ | false | false | 6,745 | cpp |
#include "huaweicloud/cdn/v2/model/RequestLimitRules.h"
namespace HuaweiCloud {
namespace Sdk {
namespace Cdn {
namespace V2 {
namespace Model {
RequestLimitRules::RequestLimitRules()
{
status_ = "";
statusIsSet_ = false;
priority_ = 0;
priorityIsSet_ = false;
matchType_ = "";
matchTypeIsSet_ = false;
matchValue_ = "";
matchValueIsSet_ = false;
type_ = "";
typeIsSet_ = false;
limitRateAfter_ = 0L;
limitRateAfterIsSet_ = false;
limitRateValue_ = 0;
limitRateValueIsSet_ = false;
}
RequestLimitRules::~RequestLimitRules() = default;
void RequestLimitRules::validate()
{
}
web::json::value RequestLimitRules::toJson() const
{
web::json::value val = web::json::value::object();
if(statusIsSet_) {
val[utility::conversions::to_string_t("status")] = ModelBase::toJson(status_);
}
if(priorityIsSet_) {
val[utility::conversions::to_string_t("priority")] = ModelBase::toJson(priority_);
}
if(matchTypeIsSet_) {
val[utility::conversions::to_string_t("match_type")] = ModelBase::toJson(matchType_);
}
if(matchValueIsSet_) {
val[utility::conversions::to_string_t("match_value")] = ModelBase::toJson(matchValue_);
}
if(typeIsSet_) {
val[utility::conversions::to_string_t("type")] = ModelBase::toJson(type_);
}
if(limitRateAfterIsSet_) {
val[utility::conversions::to_string_t("limit_rate_after")] = ModelBase::toJson(limitRateAfter_);
}
if(limitRateValueIsSet_) {
val[utility::conversions::to_string_t("limit_rate_value")] = ModelBase::toJson(limitRateValue_);
}
return val;
}
bool RequestLimitRules::fromJson(const web::json::value& val)
{
bool ok = true;
if(val.has_field(utility::conversions::to_string_t("status"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("status"));
if(!fieldValue.is_null())
{
std::string refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setStatus(refVal);
}
}
if(val.has_field(utility::conversions::to_string_t("priority"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("priority"));
if(!fieldValue.is_null())
{
int32_t refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setPriority(refVal);
}
}
if(val.has_field(utility::conversions::to_string_t("match_type"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("match_type"));
if(!fieldValue.is_null())
{
std::string refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setMatchType(refVal);
}
}
if(val.has_field(utility::conversions::to_string_t("match_value"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("match_value"));
if(!fieldValue.is_null())
{
std::string refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setMatchValue(refVal);
}
}
if(val.has_field(utility::conversions::to_string_t("type"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("type"));
if(!fieldValue.is_null())
{
std::string refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setType(refVal);
}
}
if(val.has_field(utility::conversions::to_string_t("limit_rate_after"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("limit_rate_after"));
if(!fieldValue.is_null())
{
int64_t refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setLimitRateAfter(refVal);
}
}
if(val.has_field(utility::conversions::to_string_t("limit_rate_value"))) {
const web::json::value& fieldValue = val.at(utility::conversions::to_string_t("limit_rate_value"));
if(!fieldValue.is_null())
{
int32_t refVal;
ok &= ModelBase::fromJson(fieldValue, refVal);
setLimitRateValue(refVal);
}
}
return ok;
}
std::string RequestLimitRules::getStatus() const
{
return status_;
}
void RequestLimitRules::setStatus(const std::string& value)
{
status_ = value;
statusIsSet_ = true;
}
bool RequestLimitRules::statusIsSet() const
{
return statusIsSet_;
}
void RequestLimitRules::unsetstatus()
{
statusIsSet_ = false;
}
int32_t RequestLimitRules::getPriority() const
{
return priority_;
}
void RequestLimitRules::setPriority(int32_t value)
{
priority_ = value;
priorityIsSet_ = true;
}
bool RequestLimitRules::priorityIsSet() const
{
return priorityIsSet_;
}
void RequestLimitRules::unsetpriority()
{
priorityIsSet_ = false;
}
std::string RequestLimitRules::getMatchType() const
{
return matchType_;
}
void RequestLimitRules::setMatchType(const std::string& value)
{
matchType_ = value;
matchTypeIsSet_ = true;
}
bool RequestLimitRules::matchTypeIsSet() const
{
return matchTypeIsSet_;
}
void RequestLimitRules::unsetmatchType()
{
matchTypeIsSet_ = false;
}
std::string RequestLimitRules::getMatchValue() const
{
return matchValue_;
}
void RequestLimitRules::setMatchValue(const std::string& value)
{
matchValue_ = value;
matchValueIsSet_ = true;
}
bool RequestLimitRules::matchValueIsSet() const
{
return matchValueIsSet_;
}
void RequestLimitRules::unsetmatchValue()
{
matchValueIsSet_ = false;
}
std::string RequestLimitRules::getType() const
{
return type_;
}
void RequestLimitRules::setType(const std::string& value)
{
type_ = value;
typeIsSet_ = true;
}
bool RequestLimitRules::typeIsSet() const
{
return typeIsSet_;
}
void RequestLimitRules::unsettype()
{
typeIsSet_ = false;
}
int64_t RequestLimitRules::getLimitRateAfter() const
{
return limitRateAfter_;
}
void RequestLimitRules::setLimitRateAfter(int64_t value)
{
limitRateAfter_ = value;
limitRateAfterIsSet_ = true;
}
bool RequestLimitRules::limitRateAfterIsSet() const
{
return limitRateAfterIsSet_;
}
void RequestLimitRules::unsetlimitRateAfter()
{
limitRateAfterIsSet_ = false;
}
int32_t RequestLimitRules::getLimitRateValue() const
{
return limitRateValue_;
}
void RequestLimitRules::setLimitRateValue(int32_t value)
{
limitRateValue_ = value;
limitRateValueIsSet_ = true;
}
bool RequestLimitRules::limitRateValueIsSet() const
{
return limitRateValueIsSet_;
}
void RequestLimitRules::unsetlimitRateValue()
{
limitRateValueIsSet_ = false;
}
}
}
}
}
}
| [
"[email protected]"
] | |
3d75180851068227cf8199ae4dc3e6e68cfc9304 | 408a6a47509db59838a45d362707ffe6d2967a70 | /Classes/GameOver.cpp | 4d28e2c16ffb00c84449f7382cbee3caf90a2efa | [] | no_license | DanicaMeng/RabbitRun | 87d511645b90d9129d026b636adcb3e1b8854dd8 | 97892a01876186a2e69ff9776c70bdf2ea10f9bd | refs/heads/master | 2021-05-15T21:14:05.028696 | 2018-10-19T04:08:30 | 2018-10-19T04:08:30 | 27,667,757 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,388 | cpp | #include "GameOver.h"
#include "Global.h"
#include "GameScene.h"
#include "DataM.h"
GameOver::GameOver()
{
}
GameOver::~GameOver()
{
}
bool GameOver::init()
{
if ( !CCLayerColor::initWithColor(ccc4(0, 0, 0, 200)) )
{
return false;
}
DataM::getInstance()->saveHighScore();
CCLabelTTF *title = CCLabelTTF::create("Game Over", FONT_NAME, 90);
title->setPosition(ccp(SCREEN_CX, SCREEN_HEIGHT - 100));
this->addChild(title);
char s[128];
sprintf(s, "High Score: %d", DataM::getInstance()->getHighScore());
CCLabelTTF *highScore = CCLabelTTF::create(s, FONT_NAME, 80);
highScore->setAnchorPoint(ccp(0.5f, 0.5f));
highScore->setPosition(ccp(SCREEN_CX, SCREEN_HEIGHT - 250));
highScore->setColor(ccc3(255,245, 0));
this->addChild(highScore);
sprintf(s, "Score: %d", DataM::getInstance()->getScore());
CCLabelTTF *scoreShow = CCLabelTTF::create(s, FONT_NAME, 80);
scoreShow->setAnchorPoint(ccp(0.5f, 0.5f));
scoreShow->setPosition(ccp(SCREEN_CX, SCREEN_HEIGHT - 380));
scoreShow->setColor(ccc3(255,245, 0));
this->addChild(scoreShow);
CCSprite *_eagle_catch = CCSprite::createWithSpriteFrameName("eagle_dive_left.png");
_eagle_catch->setPosition(ccp(275, SCREEN_HEIGHT - 260));
_eagle_catch->setScale(0.9f);
this->addChild(_eagle_catch,1);
CCSprite *_rabbit_catched = CCSprite::create("rabbit_catched.png");
_rabbit_catched->setPosition(ccp(220, SCREEN_HEIGHT - 350));
_rabbit_catched->setScale(0.25f);
this->addChild(_rabbit_catched,2);
CCMenuItemFont::setFontName(FONT_NAME);
CCMenuItemFont::setFontSize(50);
CCMenuItemFont *restartGame = CCMenuItemFont::create("Replay", this, menu_selector(GameOver::restartGame));
restartGame->setColor(ccc3(0, 255,51));
restartGame->setPositionX(-70);
CCMenuItemFont *exitGame = CCMenuItemFont::create("Exit", this, menu_selector(GameOver::exitGame));
exitGame->setColor(ccc3(255, 0, 0));
exitGame->setPositionX(130);
CCMenu *menu = CCMenu::create(exitGame, restartGame, NULL);
menu->setPositionY(220);
menu->setTouchPriority(-201);
this->addChild(menu);
this->setTouchPriority(-200);
this->setTouchMode(kCCTouchesOneByOne);
this->setTouchEnabled(true);
return true;
}
void GameOver::restartGame(CCObject* sender)
{
this->removeFromParent();
g_gameScene->restartGame();
}
void GameOver::exitGame(CCObject* sender)
{
DataM::purge();
CCDirector::sharedDirector()->end();
} | [
"[email protected]"
] | |
5264cc54bca04f7c04401d8af196c0b133a29883 | da74ee93fd07d0f66f0a102b194b75e456948a95 | /problemset-new/011/01105-filling-bookcase-shelves/tiankonguse.cpp | 07e48eaeaf7eca38eb38f41d1c5c81120cc05b8b | [] | no_license | L65430/leetcode-solutions | c01a0199d017e89c63c41da22671d5cec2456834 | 8d3f9c04fdc1273c03d9893b8f4e1a45a6aef59f | refs/heads/master | 2020-06-13T10:35:59.220331 | 2019-06-30T13:11:07 | 2019-06-30T13:11:07 | 194,629,079 | 1 | 0 | null | 2019-07-01T08:13:36 | 2019-07-01T08:13:36 | null | UTF-8 | C++ | false | false | 1,538 | cpp | /*************************************************************************
> File Name: filling-bookcase-shelves.cpp
> Author: tiankonguse
> Mail: [email protected]
> Created Time: 2019年06月30日 11:37:47
> link:
> No: 1105. Filling Bookcase Shelves
> Contest: https://leetcode.com/contest/weekly-contest-143
************************************************************************/
#include "../../../include/base.h"
class Solution {
public:
int minHeightShelves(vector<vector<int>>& books, int shelf_width) {
vector<int> dp(books.size()+1, 1000*1000);
dp[0] = 0;
for(int i=1;i<=books.size(); i++){
auto& b = books[i-1];
int w = b[0];
int h = b[1];
dp[i] = dp[i-1] + h;
for(int j=i-1;j>0;j--){
w += books[j-1][0];
h = max(h, books[j-1][1]);
if(w > shelf_width)break;
dp[i] = min(dp[i], dp[j-1] + h);
}
}
return dp[books.size()];
}
};
/*
//ListNode* root = vecToList({1,2,3,4});
// vecToTree({});
// std::reverse(a.begin(),a.end());
//int dir[4][2] = {{0,1},{0,-1},{1,0},{-1,0}};
*/
int main() {
#define CLASS Solution
#define FUNCTION smallestRepunitDivByK
int first;
int second;
int expectAns;
first = 113;
second = 1;
expectAns = -1;
TEST_SMP1(CLASS, FUNCTION, expectAns, first);
//TEST_SMP2(Solution, FUNCTION, expectAns, first, second);
return 0;
}
| [
"[email protected]"
] | |
680a27dddaede7283ef210ef8bce1467960ee86f | cf8ddfc720bf6451c4ef4fa01684327431db1919 | /SDK/ARKSurvivalEvolved_DinoEntry_Jerboa_functions.cpp | 6e33f470e9da02901395399d064de25ec9a6d74b | [
"MIT"
] | permissive | git-Charlie/ARK-SDK | 75337684b11e7b9f668da1f15e8054052a3b600f | c38ca9925309516b2093ad8c3a70ed9489e1d573 | refs/heads/master | 2023-06-20T06:30:33.550123 | 2021-07-11T13:41:45 | 2021-07-11T13:41:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,005 | cpp | // ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_DinoEntry_Jerboa_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//---------------------------------------------------------------------------
// Function DinoEntry_Jerboa.DinoEntry_Jerboa_C.ExecuteUbergraph_DinoEntry_Jerboa
// ()
// Parameters:
// int EntryPoint (Parm, ZeroConstructor, IsPlainOldData)
void UDinoEntry_Jerboa_C::ExecuteUbergraph_DinoEntry_Jerboa(int EntryPoint)
{
static auto fn = UObject::FindObject<UFunction>("Function DinoEntry_Jerboa.DinoEntry_Jerboa_C.ExecuteUbergraph_DinoEntry_Jerboa");
UDinoEntry_Jerboa_C_ExecuteUbergraph_DinoEntry_Jerboa_Params params;
params.EntryPoint = EntryPoint;
auto flags = fn->FunctionFlags;
UObject::ProcessEvent(fn, ¶ms);
fn->FunctionFlags = flags;
}
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
| [
"[email protected]"
] | |
3ebf58a2eb5123b34b297ac3e961c3be9a52da96 | 7fd5e6156d6a42b305809f474659f641450cea81 | /glog/base/commandlineflags.h | 3ecc7729c68d73ca2cba9633f7277c53e747be26 | [] | no_license | imos/icfpc2015 | 5509b6cfc060108c9e5df8093c5bc5421c8480ea | e998055c0456c258aa86e8379180fad153878769 | refs/heads/master | 2020-04-11T04:30:08.777739 | 2015-08-10T11:53:12 | 2015-08-10T11:53:12 | 40,011,767 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,986 | h | // Copyright (c) 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// ---
// This file is a compatibility layer that defines Google's version of
// command line flags that are used for configuration.
//
// We put flags into their own namespace. It is purposefully
// named in an opaque way that people should have trouble typing
// directly. The idea is that DEFINE puts the flag in the weird
// namespace, and DECLARE imports the flag from there into the
// current namespace. The net result is to force people to use
// DECLARE to get access to a flag, rather than saying
// extern bool FLAGS_logtostderr;
// or some such instead. We want this so we can put extra
// functionality (like sanity-checking) in DECLARE if we want,
// and make sure it is picked up everywhere.
//
// We also put the type of the variable in the namespace, so that
// people can't DECLARE_int32 something that they DEFINE_bool'd
// elsewhere.
#ifndef BASE_COMMANDLINEFLAGS_H__
#define BASE_COMMANDLINEFLAGS_H__
#include "glog/config.h"
#include <string>
#include <string.h> // for memchr
#include <stdlib.h> // for getenv
#ifdef HAVE_LIB_GFLAGS
#include "gflags/gflags.h"
#else
#include "glog/logging.h"
#define DECLARE_VARIABLE(type, shorttype, name, tn) \
namespace fL##shorttype { \
extern GOOGLE_GLOG_DLL_DECL type FLAGS_##name; \
} \
using fL##shorttype::FLAGS_##name
#define DEFINE_VARIABLE(type, shorttype, name, value, meaning, tn) \
namespace fL##shorttype { \
GOOGLE_GLOG_DLL_DECL type FLAGS_##name(value); \
char FLAGS_no##name; \
} \
using fL##shorttype::FLAGS_##name
// bool specialization
#define DECLARE_bool(name) \
DECLARE_VARIABLE(bool, B, name, bool)
#define DEFINE_bool(name, value, meaning) \
DEFINE_VARIABLE(bool, B, name, value, meaning, bool)
// int32 specialization
#define DECLARE_int32(name) \
DECLARE_VARIABLE(GOOGLE_NAMESPACE::int32, I, name, int32)
#define DEFINE_int32(name, value, meaning) \
DEFINE_VARIABLE(GOOGLE_NAMESPACE::int32, I, name, value, meaning, int32)
// Special case for string, because we have to specify the namespace
// std::string, which doesn't play nicely with our FLAG__namespace hackery.
#define DECLARE_string(name) \
namespace fLS { \
extern GOOGLE_GLOG_DLL_DECL std::string& FLAGS_##name; \
} \
using fLS::FLAGS_##name
#define DEFINE_string(name, value, meaning) \
namespace fLS { \
std::string FLAGS_##name##_buf(value); \
GOOGLE_GLOG_DLL_DECL std::string& FLAGS_##name = FLAGS_##name##_buf; \
char FLAGS_no##name; \
} \
using fLS::FLAGS_##name
#endif // HAVE_LIB_GFLAGS
// Define GLOG_DEFINE_* using DEFINE_* . By using these macros, we
// have GLOG_* environ variables even if we have gflags installed.
//
// If both an environment variable and a flag are specified, the value
// specified by a flag wins. E.g., if GLOG_v=0 and --v=1, the
// verbosity will be 1, not 0.
#define GLOG_DEFINE_bool(name, value, meaning) \
DEFINE_bool(name, EnvToBool("GLOG_" #name, value), meaning)
#define GLOG_DEFINE_int32(name, value, meaning) \
DEFINE_int32(name, EnvToInt("GLOG_" #name, value), meaning)
#define GLOG_DEFINE_string(name, value, meaning) \
DEFINE_string(name, EnvToString("GLOG_" #name, value), meaning)
// These macros (could be functions, but I don't want to bother with a .cc
// file), make it easier to initialize flags from the environment.
#define EnvToString(envname, dflt) \
(!getenv(envname) ? (dflt) : getenv(envname))
#define EnvToBool(envname, dflt) \
(!getenv(envname) ? (dflt) : memchr("tTyY1\0", getenv(envname)[0], 6) != NULL)
#define EnvToInt(envname, dflt) \
(!getenv(envname) ? (dflt) : strtol(getenv(envname), NULL, 10))
#endif // BASE_COMMANDLINEFLAGS_H__
| [
"[email protected]"
] | |
a143d5774ccc967085de5ad6ed96e9f70ab7bf3e | 37d6909e8d5d50c9672064cbf9e3b921fab94741 | /백준/9935번 문자열 폭발/9935.cpp | 1677588c97387810e43a36dbad17f97597e1b34e | [] | no_license | lee-jisung/Algorithm-study | 97e795c6cb47d1f4f716719f490031479d0578ca | d42470cd24b3984dc15992089d34dbe2ae6bb70d | refs/heads/master | 2021-06-28T05:49:12.417367 | 2021-04-01T13:53:43 | 2021-04-01T13:53:43 | 225,784,579 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,082 | cpp | #include <iostream>
#include <string>
using namespace std;
/*
res에 문자를 하나씩 추가,
추가한 문자와 폭파 문자의 끝이 같다면 => 끝에서부터 거꾸로 탐색하여 폭파와 같은 문자열이 추가됐는지 확인
-> 현재 추가하는 idx가 폭파열 길이보다 작다면 pass
- 추가되었다면 idx를 폭파열 길이만큼 줄여주고 다시 해당 idx부터 문자 추가
- 아니라면 pass
*/
int idx;
string str, boom;
char res[1000001];
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> str >> boom;
for (int i = 0; i < str.length(); i++) {
res[idx++] = str[i];
if (res[idx - 1] == boom[boom.length() - 1]) {
if (idx < boom.length()) continue;
bool correct = true;
for (int j = 0; j < boom.length(); j++) {
if (res[idx - j - 1] != boom[boom.length() - j - 1]) {
correct = false;
break;
}
}
if (correct)
idx -= boom.length();
}
}
if (!idx) cout << "FRULA\n";
else {
for (int i = 0;i < idx; i++) cout << res[i];
cout << "\n";
}
return 0;
}
| [
"[email protected]"
] | |
2afdfb525ef59c8d35a41a3fc715dee015ccea5c | 8929e7535533d43e62f0dde3d384ee46cc28e3c7 | /AnimationManager/AnimationModel.cpp | de7eee0b1a74c198c6a4c9d0db161db7d38c4bab | [] | no_license | Nakio195/OSSAM-Editor | 4e2b2311a278d3042f7774d8a53fff5846ce2d73 | bcaf2fc2cab28a38fd723e48a79eb886d7a61d59 | refs/heads/master | 2023-03-08T22:52:08.781597 | 2023-03-03T18:04:43 | 2023-03-03T18:04:43 | 86,177,811 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,974 | cpp | #include "AnimationModel.h"
#include <QJsonDocument>
#include <QJsonArray>
#include <QFile>
#include <QMessageBox>
AnimationModel::AnimationModel(AssetModel *assets, QObject *parent)
: QAbstractTableModel(parent), mAssets(assets)
{
}
QVariant AnimationModel::headerData(int section, Qt::Orientation orientation, int role) const
{
if(orientation == Qt::Horizontal)
{
if(role == Qt::DisplayRole)
{
switch(section)
{
case AnimationModel::ID:
return QVariant(QString("ID"));
case AnimationModel::Name:
return QVariant(QString("Nom"));
case AnimationModel::TextureUID:
return QVariant(QString("Texture ID"));
case AnimationModel::FrameCount:
return QVariant(QString("Images"));
case AnimationModel::RectWidth:
return QVariant(QString("Largeur"));
case AnimationModel::RectHeight:
return QVariant(QString("Hauteur"));
case AnimationModel::Period:
return QVariant(QString("Periode"));
case AnimationModel::TimerMode:
return QVariant(QString("Timer Mode"));
}
}
}
return QVariant();
}
int AnimationModel::rowCount(const QModelIndex &parent) const
{
if (parent.isValid())
return 0;
return mAnimations.count();
// FIXME: Implement me!
}
int AnimationModel::columnCount(const QModelIndex &parent) const
{
if (parent.isValid())
return 0;
return 8;
// FIXME: Implement me!
}
void AnimationModel::sort(int column, Qt::SortOrder order)
{
layoutAboutToBeChanged();
if(column == ID)
{
if(order == Qt::AscendingOrder)
qSort(mAnimations.begin(), mAnimations.end(), [] (const Animation& a, const Animation& b) { return a.getUID() < b.getUID();});
else
qSort(mAnimations.begin(), mAnimations.end(), [] (const Animation& a, const Animation& b) { return a.getUID() > b.getUID();});
}
if(column == Name)
{
if(order == Qt::AscendingOrder)
qSort(mAnimations.begin(), mAnimations.end(), [] (const Animation& a, const Animation& b) { return a.getName() < b.getName();});
else
qSort(mAnimations.begin(), mAnimations.end(), [] (const Animation& a, const Animation& b) { return a.getName() > b.getName();});
}
layoutChanged();
}
QVariant AnimationModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid())
return QVariant();
if(index.row() >= mAnimations.count())
return QVariant();
if(role == Qt::DisplayRole || role == Qt::EditRole)
{
switch(index.column())
{
case AnimationModel::ID:
return QVariant(QString::number(mAnimations[index.row()].getUID()));
case AnimationModel::Name:
return QVariant(mAnimations[index.row()].getName());
case AnimationModel::TextureUID:
return QVariant(mAnimations[index.row()].getTextureUID());
case AnimationModel::FrameCount:
return QVariant(mAnimations[index.row()].getFrames());
case AnimationModel::RectWidth:
return QVariant(mAnimations[index.row()].getWidth());
case AnimationModel::RectHeight:
return QVariant(mAnimations[index.row()].getHeight());
case AnimationModel::Period:
return QVariant(mAnimations[index.row()].getPeriod());
case AnimationModel::TimerMode:
switch(mAnimations[index.row()].getMode())
{
case Animation::OneShot:
return QVariant(QString("One shot"));
case Animation::Continous:
return QVariant(QString("Continu"));
}
break;
}
}
if(role == Qt::BackgroundRole)
return index.row() % 2 ? QVariant(QBrush(QColor(0, 140, 255))) : QVariant(QBrush(QColor(100, 180, 255)));
return QVariant();
}
bool AnimationModel::setData(const QModelIndex &index, const QVariant &value, int role)
{
if(index.isValid() && role == Qt::EditRole)
{
if(index.row() < mAnimations.size())
{
switch(index.column())
{
case AnimationModel::ID:
break;
case AnimationModel::Name:
mAnimations[index.row()].setName(value.toString());
emit dataChanged(index, index, {role});
return true;
}
}
}
return false;
}
Qt::ItemFlags AnimationModel::flags(const QModelIndex &index) const
{
if (!index.isValid())
return Qt::ItemIsEnabled;
return QAbstractItemModel::flags(index) | Qt::ItemIsSelectable;
}
bool AnimationModel::insertRows(int , int , const QModelIndex &)
{
return false;
}
bool AnimationModel::insertColumns(int , int , const QModelIndex &)
{
return false;
}
const QVector<Animation>& AnimationModel::getAnimations()
{
return mAnimations;
}
bool AnimationModel::readJSON(QJsonObject &json)
{
if(json.contains("animations") && json["animations"].isArray())
{
unsigned long long maxUID = 0;
QJsonArray array = json["animations"].toArray();
beginResetModel();
mAnimations.clear();
endResetModel();
beginInsertRows(QModelIndex(), 0, array.size());
mAnimations.reserve(array.size());
for(int row = 0; row < array.size(); row++)
{
QJsonObject json = array[row].toObject();
Animation anim;
anim.fromJSON(json);
mAnimations.push_back(anim);
mAssets->addAsset(&mAnimations.last());
if(anim.getUID() > maxUID)
maxUID = anim.getUID();
}
Animation::setCurrentUID(maxUID+1);
endInsertRows();
return true;
}
return false;
}
void AnimationModel::writeJSON(QJsonObject& json)
{
json.insert("count", QString::number(mAnimations.count()));
QJsonArray animArray;
for(auto& anim : mAnimations)
{
QJsonObject obj;
anim.toJSON(obj);
animArray.append(obj);
}
json.insert("animations", animArray);
}
const Animation AnimationModel::getAnimation(int row)
{
if(row >= mAnimations.count())
return Animation();
return mAnimations[row];
}
const Animation AnimationModel::getByUID(Animation::UID uid)
{
for(auto& anim : mAnimations)
{
if(anim.getUID() == uid)
return anim;
}
return Animation();
}
void AnimationModel::removeAnimation(Animation::UID uid)
{
int row = -1;
for(int i = 0; i < mAnimations.count(); i++)
{
if(mAnimations[i].getUID() == uid)
{
row = i;
break;
}
}
if(row == -1)
return;
beginRemoveRows(QModelIndex(), row, row);
mAnimations.removeAt(row);
endRemoveRows();
}
void AnimationModel::addAnimation(Animation anim)
{
beginInsertRows(QModelIndex(), mAnimations.count(), mAnimations.count());
mAnimations.insert(mAnimations.count(), anim);
mAssets->addAsset(&mAnimations.last());
endInsertRows();
}
unsigned long long AnimationModel::getUID(QModelIndex index)
{
if(!index.isValid())
return 0;
return mAnimations[index.row()].getUID();
}
bool AnimationModel::loadFromFile(QString path)
{
QFile AnimFile(path);
if(!AnimFile.open(QIODevice::ReadOnly))
QMessageBox::critical(nullptr, "Erreur plutôt critique quand même", "Impossible d'accéder au fichier de sauvegarde des Animations : " + path);
else
{
QJsonObject anims(QJsonDocument::fromJson(AnimFile.readAll()).object());
readJSON(anims);
return true;
}
return false;
}
| [
"[email protected]"
] | |
ebba2782c33c6c8860e1510abfd8958ce08021ff | 7744436f65e0e66d336d60656776d9de3b70e56c | /windows_internals/processassignments/createthreadterminate.cpp | ee4ecabdfadde4b4e578a764544fccf95394a0e2 | [] | no_license | paruchurimadhurima/NCR-INTERN | e91082888e80c1d0983828c6ce434eac5654020c | 2471c98e152a0ec13a2cdfc97268726f039a454b | refs/heads/master | 2021-01-13T21:07:17.418646 | 2020-03-20T12:56:25 | 2020-03-20T12:56:25 | 242,494,608 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 999 | cpp | #include<Windows.h>
#include<iostream>
#include<tchar.h>
using namespace std;
/*
DWORD WINAPI ThreadFun(LPVOID Str)
{
cout << "Hi" << endl;
return 0;
}
int _tmain(int argc, WCHAR* argv[], WCHAR* env[])
{
HANDLE CreateThreadHandle;
LPVOID Str = NULL;
CreateThreadHandle = CreateThread(NULL,//security attributes thread is not inherited if null
0,//stack size for thread if 0 it uses size of executable
ThreadFun,//call back function
Str,//parameter to function
0,//creation flag
NULL);//thread id
if (CreateThreadHandle == NULL)
{
cout << "creation of thread failed due to error (" << GetLastError() << ")" << endl;
}
LPDWORD retval = (LPDWORD)WaitForSingleObject(CreateThreadHandle, INFINITE);
//cout << TerminateThread(CreateThreadHandle, GetExitCodeThread(CreateThreadHandle, retval)) << endl;
CloseHandle(CreateThreadHandle);
cout << TerminateThread(CreateThreadHandle, GetExitCodeThread(CreateThreadHandle, retval)) << endl;
//close the handle after use
return 0;
}*/ | [
"INSERT_YOUR_EMAIL"
] | INSERT_YOUR_EMAIL |
e78c75429264cd1c53f8853558b8002b2687edc6 | 51c7fb59d55f32fa39f0428c227dabdf7313b990 | /编程7.15.cpp | 79bc218da953a0ef2505ec956fb64ca02511c047 | [] | no_license | longme2/C | ce3a29d99dc9178b6a36a09c35354ad9f0479572 | c31ae4b6215c33e1fd587701e16077f8344f23dd | refs/heads/master | 2020-05-15T09:31:24.739955 | 2019-04-19T01:33:48 | 2019-04-19T01:33:48 | 182,178,893 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 222 | cpp | #include<stdio.h>
int main()
{
int a,sum=1,n;
printf("Enter a positive integer: ");
scanf("%d",&a);
n=a;
while(a!=0)
{
sum*=a;
a--;
}
printf("Factorial of %d: %d",n,sum);
return 0;
}
| [
"[email protected]"
] | |
b8d63402eefbadd26950c0e9090c4dde86a82e1d | bc2a6e1f41ced330c04c199d0e13f7f8b82bd6ef | /src/halibs/examples/src/button.cpp | cb3b3d2acff34c3d9c4a794b9cb7070c0efea9bc | [] | no_license | SoCXin/MEGA328P | 372187c044c402ae90c3c3192b4d90f8ea996f3e | 321166c6f287e441d0ae906ecfddc5d3cff706f2 | refs/heads/master | 2023-04-27T02:10:27.492148 | 2021-05-18T07:51:01 | 2021-05-18T07:51:01 | 157,304,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 804 | cpp | /**
* \file examples/applications/button.cpp
* \brief Example for usage of Button and Led (very simple)
*
* This file is part of avr-halib. See COPYING for copyright details.
*/
#include "platform.h"
#include "avr-halib/drivers/ext/button.h"
#include "avr-halib/drivers/ext/led.h"
using avr_halib::drivers::ext::Button;
using avr_halib::drivers::ext::Led;
int main()
{
Button< platform::Button0 > button0;
Led < platform::Led0 > led0;
Led < platform::Led1 > led1;
Led < platform::Led2 > led2;
while (1)
{
if(button0.isPressed())
{
led0.set(1);
led1.set(1);
led2.set(1);
}
else
{
led0.set(0);
led1.set(0);
led2.set(0);
}
}
}
| [
"[email protected]"
] | |
404ac6bb71782c5e2a0c8395ac9995cae9f90903 | 9da42e04bdaebdf0193a78749a80c4e7bf76a6cc | /third_party/gecko-2/win32/include/nsIURIRefObject.h | 65aa1424aabdd0a75bf16b806f1ef2cb1298fb74 | [
"Apache-2.0"
] | permissive | bwp/SeleniumWebDriver | 9d49e6069881845e9c23fb5211a7e1b8959e2dcf | 58221fbe59fcbbde9d9a033a95d45d576b422747 | refs/heads/master | 2021-01-22T21:32:50.541163 | 2012-11-09T16:19:48 | 2012-11-09T16:19:48 | 6,602,097 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,439 | h | /*
* DO NOT EDIT. THIS FILE IS GENERATED FROM e:/builds/moz2_slave/rel-2.0-xr-w32-bld/build/editor/idl/nsIURIRefObject.idl
*/
#ifndef __gen_nsIURIRefObject_h__
#define __gen_nsIURIRefObject_h__
#ifndef __gen_nsISupports_h__
#include "nsISupports.h"
#endif
#ifndef __gen_domstubs_h__
#include "domstubs.h"
#endif
/* For IDL files that don't want to include root IDL files. */
#ifndef NS_NO_VTABLE
#define NS_NO_VTABLE
#endif
class nsIDOMNode; /* forward declaration */
/* starting interface: nsIURIRefObject */
#define NS_IURIREFOBJECT_IID_STR "2226927e-1dd2-11b2-b57f-faab47288563"
#define NS_IURIREFOBJECT_IID \
{0x2226927e, 0x1dd2, 0x11b2, \
{ 0xb5, 0x7f, 0xfa, 0xab, 0x47, 0x28, 0x85, 0x63 }}
/** A class which can represent any node which points to an
* external URI, e.g. <a>, <img>, <script> etc,
* and has the capability to rewrite URLs to be
* relative or absolute.
* Used by the editor but not dependant on it.
*/
class NS_NO_VTABLE NS_SCRIPTABLE nsIURIRefObject : public nsISupports {
public:
NS_DECLARE_STATIC_IID_ACCESSOR(NS_IURIREFOBJECT_IID)
/* attribute nsIDOMNode node; */
NS_SCRIPTABLE NS_IMETHOD GetNode(nsIDOMNode **aNode) = 0;
NS_SCRIPTABLE NS_IMETHOD SetNode(nsIDOMNode *aNode) = 0;
/**
* Go back to the beginning of the attribute list.
*/
/* void Reset (); */
NS_SCRIPTABLE NS_IMETHOD Reset(void) = 0;
/**
* Return the next rewritable URI.
*/
/* DOMString GetNextURI (); */
NS_SCRIPTABLE NS_IMETHOD GetNextURI(nsAString & _retval NS_OUTPARAM) = 0;
/**
* Go back to the beginning of the attribute list
*
* @param aOldPat Old pattern to be replaced, e.g. file:///a/b/
* @param aNewPat New pattern to be replaced, e.g. http://mypage.aol.com/
* @param aMakeRel Rewrite links as relative vs. absolute
*/
/* void RewriteAllURIs (in DOMString aOldPat, in DOMString aNewPat, in boolean aMakeRel); */
NS_SCRIPTABLE NS_IMETHOD RewriteAllURIs(const nsAString & aOldPat, const nsAString & aNewPat, PRBool aMakeRel) = 0;
};
NS_DEFINE_STATIC_IID_ACCESSOR(nsIURIRefObject, NS_IURIREFOBJECT_IID)
/* Use this macro when declaring classes that implement this interface. */
#define NS_DECL_NSIURIREFOBJECT \
NS_SCRIPTABLE NS_IMETHOD GetNode(nsIDOMNode **aNode); \
NS_SCRIPTABLE NS_IMETHOD SetNode(nsIDOMNode *aNode); \
NS_SCRIPTABLE NS_IMETHOD Reset(void); \
NS_SCRIPTABLE NS_IMETHOD GetNextURI(nsAString & _retval NS_OUTPARAM); \
NS_SCRIPTABLE NS_IMETHOD RewriteAllURIs(const nsAString & aOldPat, const nsAString & aNewPat, PRBool aMakeRel);
/* Use this macro to declare functions that forward the behavior of this interface to another object. */
#define NS_FORWARD_NSIURIREFOBJECT(_to) \
NS_SCRIPTABLE NS_IMETHOD GetNode(nsIDOMNode **aNode) { return _to GetNode(aNode); } \
NS_SCRIPTABLE NS_IMETHOD SetNode(nsIDOMNode *aNode) { return _to SetNode(aNode); } \
NS_SCRIPTABLE NS_IMETHOD Reset(void) { return _to Reset(); } \
NS_SCRIPTABLE NS_IMETHOD GetNextURI(nsAString & _retval NS_OUTPARAM) { return _to GetNextURI(_retval); } \
NS_SCRIPTABLE NS_IMETHOD RewriteAllURIs(const nsAString & aOldPat, const nsAString & aNewPat, PRBool aMakeRel) { return _to RewriteAllURIs(aOldPat, aNewPat, aMakeRel); }
/* Use this macro to declare functions that forward the behavior of this interface to another object in a safe way. */
#define NS_FORWARD_SAFE_NSIURIREFOBJECT(_to) \
NS_SCRIPTABLE NS_IMETHOD GetNode(nsIDOMNode **aNode) { return !_to ? NS_ERROR_NULL_POINTER : _to->GetNode(aNode); } \
NS_SCRIPTABLE NS_IMETHOD SetNode(nsIDOMNode *aNode) { return !_to ? NS_ERROR_NULL_POINTER : _to->SetNode(aNode); } \
NS_SCRIPTABLE NS_IMETHOD Reset(void) { return !_to ? NS_ERROR_NULL_POINTER : _to->Reset(); } \
NS_SCRIPTABLE NS_IMETHOD GetNextURI(nsAString & _retval NS_OUTPARAM) { return !_to ? NS_ERROR_NULL_POINTER : _to->GetNextURI(_retval); } \
NS_SCRIPTABLE NS_IMETHOD RewriteAllURIs(const nsAString & aOldPat, const nsAString & aNewPat, PRBool aMakeRel) { return !_to ? NS_ERROR_NULL_POINTER : _to->RewriteAllURIs(aOldPat, aNewPat, aMakeRel); }
#if 0
/* Use the code below as a template for the implementation class for this interface. */
/* Header file */
class nsURIRefObject : public nsIURIRefObject
{
public:
NS_DECL_ISUPPORTS
NS_DECL_NSIURIREFOBJECT
nsURIRefObject();
private:
~nsURIRefObject();
protected:
/* additional members */
};
/* Implementation file */
NS_IMPL_ISUPPORTS1(nsURIRefObject, nsIURIRefObject)
nsURIRefObject::nsURIRefObject()
{
/* member initializers and constructor code */
}
nsURIRefObject::~nsURIRefObject()
{
/* destructor code */
}
/* attribute nsIDOMNode node; */
NS_IMETHODIMP nsURIRefObject::GetNode(nsIDOMNode **aNode)
{
return NS_ERROR_NOT_IMPLEMENTED;
}
NS_IMETHODIMP nsURIRefObject::SetNode(nsIDOMNode *aNode)
{
return NS_ERROR_NOT_IMPLEMENTED;
}
/* void Reset (); */
NS_IMETHODIMP nsURIRefObject::Reset()
{
return NS_ERROR_NOT_IMPLEMENTED;
}
/* DOMString GetNextURI (); */
NS_IMETHODIMP nsURIRefObject::GetNextURI(nsAString & _retval NS_OUTPARAM)
{
return NS_ERROR_NOT_IMPLEMENTED;
}
/* void RewriteAllURIs (in DOMString aOldPat, in DOMString aNewPat, in boolean aMakeRel); */
NS_IMETHODIMP nsURIRefObject::RewriteAllURIs(const nsAString & aOldPat, const nsAString & aNewPat, PRBool aMakeRel)
{
return NS_ERROR_NOT_IMPLEMENTED;
}
/* End of implementation class template. */
#endif
#endif /* __gen_nsIURIRefObject_h__ */
| [
"[email protected]"
] | |
3ebf22a746c60d25d144c770b282cebdf6e8f1ec | 76be06b529203553c26366904bd1bc8fce167048 | /testPierrot/test_courbure_gaussienne/tp1/build-starterLight-Desktop-Debug/ui_dialoghistogramme.h | eb5420f05668257ffb12aab6c41546d089529db3 | [] | no_license | jjzhang166/PFE_Livewire | 824393dab6a6c712ef38b95480b705f51490fb07 | decbeeef7d70a4e2b3bf1e39840aeaef3095f264 | refs/heads/master | 2022-04-12T12:07:42.104463 | 2020-03-26T23:23:42 | 2020-03-26T23:23:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,350 | h | /********************************************************************************
** Form generated from reading UI file 'dialoghistogramme.ui'
**
** Created by: Qt User Interface Compiler version 5.9.5
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
********************************************************************************/
#ifndef UI_DIALOGHISTOGRAMME_H
#define UI_DIALOGHISTOGRAMME_H
#include <QtCore/QVariant>
#include <QtWidgets/QAction>
#include <QtWidgets/QApplication>
#include <QtWidgets/QButtonGroup>
#include <QtWidgets/QDialog>
#include <QtWidgets/QDialogButtonBox>
#include <QtWidgets/QHeaderView>
#include <QtWidgets/QVBoxLayout>
#include "QtCharts"
QT_BEGIN_NAMESPACE
class Ui_DialogHistogramme
{
public:
QVBoxLayout *verticalLayout;
QChartView *_myQChartView;
QDialogButtonBox *buttonBox;
void setupUi(QDialog *DialogHistogramme)
{
if (DialogHistogramme->objectName().isEmpty())
DialogHistogramme->setObjectName(QStringLiteral("DialogHistogramme"));
DialogHistogramme->resize(624, 367);
verticalLayout = new QVBoxLayout(DialogHistogramme);
verticalLayout->setObjectName(QStringLiteral("verticalLayout"));
_myQChartView = new QChartView(DialogHistogramme);
_myQChartView->setObjectName(QStringLiteral("_myQChartView"));
verticalLayout->addWidget(_myQChartView);
buttonBox = new QDialogButtonBox(DialogHistogramme);
buttonBox->setObjectName(QStringLiteral("buttonBox"));
buttonBox->setOrientation(Qt::Horizontal);
buttonBox->setStandardButtons(QDialogButtonBox::Close);
verticalLayout->addWidget(buttonBox);
retranslateUi(DialogHistogramme);
QObject::connect(buttonBox, SIGNAL(accepted()), DialogHistogramme, SLOT(accept()));
QObject::connect(buttonBox, SIGNAL(rejected()), DialogHistogramme, SLOT(reject()));
QMetaObject::connectSlotsByName(DialogHistogramme);
} // setupUi
void retranslateUi(QDialog *DialogHistogramme)
{
DialogHistogramme->setWindowTitle(QApplication::translate("DialogHistogramme", "Dialog", Q_NULLPTR));
} // retranslateUi
};
namespace Ui {
class DialogHistogramme: public Ui_DialogHistogramme {};
} // namespace Ui
QT_END_NAMESPACE
#endif // UI_DIALOGHISTOGRAMME_H
| [
"[email protected]"
] | |
af96e325aebb10caaa5f6792c3c70083c482d0c4 | d0c44dd3da2ef8c0ff835982a437946cbf4d2940 | /cmake-build-debug/programs_tiling/function13917/function13917_schedule_5/function13917_schedule_5_wrapper.cpp | bbdfb7a81e8dfba072c621377844fce107301b0c | [] | no_license | IsraMekki/tiramisu_code_generator | 8b3f1d63cff62ba9f5242c019058d5a3119184a3 | 5a259d8e244af452e5301126683fa4320c2047a3 | refs/heads/master | 2020-04-29T17:27:57.987172 | 2019-04-23T16:50:32 | 2019-04-23T16:50:32 | 176,297,755 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 926 | cpp | #include "Halide.h"
#include "function13917_schedule_5_wrapper.h"
#include "tiramisu/utils.h"
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <fstream>
#include <chrono>
#define MAX_RAND 200
int main(int, char **){
Halide::Buffer<int32_t> buf00(524288, 128);
Halide::Buffer<int32_t> buf0(524288, 128);
init_buffer(buf0, (int32_t)0);
auto t1 = std::chrono::high_resolution_clock::now();
function13917_schedule_5(buf00.raw_buffer(), buf0.raw_buffer());
auto t2 = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = t2 - t1;
std::ofstream exec_times_file;
exec_times_file.open("../data/programs/function13917/function13917_schedule_5/exec_times.txt", std::ios_base::app);
if (exec_times_file.is_open()){
exec_times_file << diff.count() * 1000000 << "us" <<std::endl;
exec_times_file.close();
}
return 0;
} | [
"[email protected]"
] | |
a408ce3b8abc1ee03017a76d9db859ce29ec48b5 | 1afec7d1d3099138b5afe5fd73dfd3d24ff4eb15 | /src/wallet/transaction.cpp | 0c72293af4bc8870f456e50415b643b1eaedf021 | [
"MIT"
] | permissive | republic-productions/finalcoin | 5c7c6b0734178fe22db63f0946ec555f59e8d0eb | 7c0f335ded1e5c662034c822ca2c474b8e62778f | refs/heads/main | 2023-09-04T17:04:32.683667 | 2021-10-14T17:45:22 | 2021-10-14T17:45:22 | 417,209,088 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 723 | cpp | // Copyright (c) 2021 The Finalcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <wallet/transaction.h>
bool CWalletTx::IsEquivalentTo(const CWalletTx& _tx) const
{
CMutableTransaction tx1 {*this->tx};
CMutableTransaction tx2 {*_tx.tx};
for (auto& txin : tx1.vin) txin.scriptSig = CScript();
for (auto& txin : tx2.vin) txin.scriptSig = CScript();
return CTransaction(tx1) == CTransaction(tx2);
}
bool CWalletTx::InMempool() const
{
return fInMempool;
}
int64_t CWalletTx::GetTxTime() const
{
int64_t n = nTimeSmart;
return n ? n : nTimeReceived;
}
| [
"[email protected]"
] | |
bc4c8f3a546de62475be2017bc85e432dd816b27 | 1c444bdf16632d78a3801a7fe6b35c054c4cddde | /include/bds/bedrock/actor/goal/VexRandomMoveGoal.h | d24911fa64bd88afd1df55fa91e697de3ec96fec | [] | no_license | maksym-pasichnyk/symbols | 962a082bf6a692563402c87eb25e268e7e712c25 | 7673aa52391ce93540f0e65081f16cd11c2aa606 | refs/heads/master | 2022-04-11T03:17:18.078103 | 2020-03-15T11:30:36 | 2020-03-15T11:30:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 579 | h | #pragma once
#include <string>
#include "Goal.h"
class VexRandomMoveGoal : public Goal {
public:
~VexRandomMoveGoal(); // _ZN17VexRandomMoveGoalD2Ev
virtual bool canUse(); // _ZN17VexRandomMoveGoal6canUseEv
virtual bool canContinueToUse(); // _ZN17VexRandomMoveGoal16canContinueToUseEv
virtual void tick(); // _ZN17VexRandomMoveGoal4tickEv
virtual void appendDebugInfo(std::string &)const; // _ZNK17VexRandomMoveGoal15appendDebugInfoERNSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEE
VexRandomMoveGoal(Mob &); // _ZN17VexRandomMoveGoalC2ER3Mob
};
| [
"[email protected]"
] | |
f4fbd5f57a4cded0cb521841d4468141c9a6eaba | 57ef781e0cb3d3701c358be39213eeba96ff780d | /priority_linkedlist.cpp | 54b8a3a45e1d02911398687b37b721d31dc95644 | [] | no_license | hpatelcode/Data-Structures | bf06428e99e5f4ae5d09f1af1a33c8a607463e11 | d40a4245bed0dbeec12df43446dfc5aa276e911b | refs/heads/master | 2020-04-21T15:38:05.665161 | 2019-02-08T02:39:40 | 2019-02-08T02:39:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 225 | cpp | #include <iostream>
#include "DoublyLinkedList.h"
using namespace std;
class priority_linkedlist {
public:
//priority_linkedlist(){
//Node *head = NULL;
//}
void push (int x){
//Node *n;
//n = new Node;
}
};
| [
"[email protected]"
] | |
4e377a17082231d429b0fcee09527701b936e4f2 | 5e1ae0c5e8f26339759b43e6627771edcf7d16ce | /art/compiler/dex/vreg_analysis.cc | 7e1e7e184732d4a0a04cb2dfa453cc6975729e00 | [
"NCSA",
"Apache-2.0"
] | permissive | guoyanjun0313/cb40_6735 | d303eec21051633ee52230704a1dfd0f3c579cc0 | fc5aa800555da17f2c2c3f75f95f772ff67b40c0 | refs/heads/master | 2022-12-28T16:44:38.678552 | 2018-04-18T03:00:31 | 2018-04-18T03:00:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,959 | cc | /*
* Copyright (C) 2014 MediaTek Inc.
* Modification based on code covered by the mentioned copyright
* and/or permission notice(s).
*/
/*
* Copyright (C) 2011 The Android Open Source Project
*
* 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 "compiler_internals.h"
#include "dex/dataflow_iterator-inl.h"
namespace art {
bool MIRGraph::SetFp(int index, bool is_fp) {
bool change = false;
if (is_fp && !reg_location_[index].fp) {
reg_location_[index].fp = true;
reg_location_[index].defined = true;
change = true;
}
return change;
}
bool MIRGraph::SetFp(int index) {
bool change = false;
if (!reg_location_[index].fp) {
reg_location_[index].fp = true;
reg_location_[index].defined = true;
change = true;
}
return change;
}
bool MIRGraph::SetCore(int index, bool is_core) {
bool change = false;
if (is_core && !reg_location_[index].defined) {
reg_location_[index].core = true;
reg_location_[index].defined = true;
change = true;
}
return change;
}
bool MIRGraph::SetCore(int index) {
bool change = false;
if (!reg_location_[index].defined) {
reg_location_[index].core = true;
reg_location_[index].defined = true;
change = true;
}
return change;
}
bool MIRGraph::SetRef(int index, bool is_ref) {
bool change = false;
if (is_ref && !reg_location_[index].defined) {
reg_location_[index].ref = true;
reg_location_[index].defined = true;
change = true;
}
return change;
}
bool MIRGraph::SetRef(int index) {
bool change = false;
if (!reg_location_[index].defined) {
reg_location_[index].ref = true;
reg_location_[index].defined = true;
change = true;
}
return change;
}
bool MIRGraph::SetWide(int index, bool is_wide) {
bool change = false;
if (is_wide && !reg_location_[index].wide) {
reg_location_[index].wide = true;
change = true;
}
return change;
}
bool MIRGraph::SetWide(int index) {
bool change = false;
if (!reg_location_[index].wide) {
reg_location_[index].wide = true;
change = true;
}
return change;
}
bool MIRGraph::SetHigh(int index, bool is_high) {
bool change = false;
if (is_high && !reg_location_[index].high_word) {
reg_location_[index].high_word = true;
change = true;
}
return change;
}
bool MIRGraph::SetHigh(int index) {
bool change = false;
if (!reg_location_[index].high_word) {
reg_location_[index].high_word = true;
change = true;
}
return change;
}
/*
* Infer types and sizes. We don't need to track change on sizes,
* as it doesn't propagate. We're guaranteed at least one pass through
* the cfg.
*/
bool MIRGraph::InferTypeAndSize(BasicBlock* bb, MIR* mir, bool changed) {
SSARepresentation *ssa_rep = mir->ssa_rep;
/*
* The dex bytecode definition does not explicitly outlaw the definition of the same
* virtual register to be used in both a 32-bit and 64-bit pair context. However, dx
* does not generate this pattern (at least recently). Further, in the next revision of
* dex, we will forbid this. To support the few cases in the wild, detect this pattern
* and punt to the interpreter.
*/
bool type_mismatch = false;
if (ssa_rep) {
uint64_t attrs = GetDataFlowAttributes(mir);
const int* uses = ssa_rep->uses;
const int* defs = ssa_rep->defs;
// Handle defs
if (attrs & DF_DA) {
if (attrs & DF_CORE_A) {
changed |= SetCore(defs[0]);
}
if (attrs & DF_REF_A) {
changed |= SetRef(defs[0]);
}
if (attrs & DF_A_WIDE) {
reg_location_[defs[0]].wide = true;
reg_location_[defs[1]].wide = true;
reg_location_[defs[1]].high_word = true;
DCHECK_EQ(SRegToVReg(defs[0])+1,
SRegToVReg(defs[1]));
}
}
// Handles uses
int next = 0;
if (attrs & DF_UA) {
if (attrs & DF_CORE_A) {
changed |= SetCore(uses[next]);
}
if (attrs & DF_REF_A) {
changed |= SetRef(uses[next]);
}
if (attrs & DF_A_WIDE) {
reg_location_[uses[next]].wide = true;
reg_location_[uses[next + 1]].wide = true;
reg_location_[uses[next + 1]].high_word = true;
DCHECK_EQ(SRegToVReg(uses[next])+1,
SRegToVReg(uses[next + 1]));
next += 2;
} else {
type_mismatch |= reg_location_[uses[next]].wide;
next++;
}
}
if (attrs & DF_UB) {
if (attrs & DF_CORE_B) {
changed |= SetCore(uses[next]);
}
if (attrs & DF_REF_B) {
changed |= SetRef(uses[next]);
}
if (attrs & DF_B_WIDE) {
reg_location_[uses[next]].wide = true;
reg_location_[uses[next + 1]].wide = true;
reg_location_[uses[next + 1]].high_word = true;
DCHECK_EQ(SRegToVReg(uses[next])+1,
SRegToVReg(uses[next + 1]));
next += 2;
} else {
type_mismatch |= reg_location_[uses[next]].wide;
next++;
}
}
if (attrs & DF_UC) {
if (attrs & DF_CORE_C) {
changed |= SetCore(uses[next]);
}
if (attrs & DF_REF_C) {
changed |= SetRef(uses[next]);
}
if (attrs & DF_C_WIDE) {
reg_location_[uses[next]].wide = true;
reg_location_[uses[next + 1]].wide = true;
reg_location_[uses[next + 1]].high_word = true;
DCHECK_EQ(SRegToVReg(uses[next])+1,
SRegToVReg(uses[next + 1]));
} else {
type_mismatch |= reg_location_[uses[next]].wide;
}
}
// Special-case return handling
if ((mir->dalvikInsn.opcode == Instruction::RETURN) ||
(mir->dalvikInsn.opcode == Instruction::RETURN_WIDE) ||
(mir->dalvikInsn.opcode == Instruction::RETURN_OBJECT)) {
switch (cu_->shorty[0]) {
case 'I':
type_mismatch |= reg_location_[uses[0]].wide;
changed |= SetCore(uses[0]);
break;
case 'J':
changed |= SetCore(uses[0]);
changed |= SetCore(uses[1]);
reg_location_[uses[0]].wide = true;
reg_location_[uses[1]].wide = true;
reg_location_[uses[1]].high_word = true;
break;
case 'F':
type_mismatch |= reg_location_[uses[0]].wide;
changed |= SetFp(uses[0]);
break;
case 'D':
changed |= SetFp(uses[0]);
changed |= SetFp(uses[1]);
reg_location_[uses[0]].wide = true;
reg_location_[uses[1]].wide = true;
reg_location_[uses[1]].high_word = true;
break;
case 'L':
type_mismatch |= reg_location_[uses[0]].wide;
changed |= SetRef(uses[0]);
break;
default: break;
}
}
// Special-case handling for format 35c/3rc invokes
Instruction::Code opcode = mir->dalvikInsn.opcode;
int flags = MIR::DecodedInstruction::IsPseudoMirOp(opcode) ?
0 : Instruction::FlagsOf(mir->dalvikInsn.opcode);
if ((flags & Instruction::kInvoke) &&
(attrs & (DF_FORMAT_35C | DF_FORMAT_3RC))) {
DCHECK_EQ(next, 0);
int target_idx = mir->dalvikInsn.vB;
const char* shorty = GetShortyFromTargetIdx(target_idx);
// Handle result type if floating point
if ((shorty[0] == 'F') || (shorty[0] == 'D')) {
MIR* move_result_mir = FindMoveResult(bb, mir);
// Result might not be used at all, so no move-result
if (move_result_mir && (move_result_mir->dalvikInsn.opcode !=
Instruction::MOVE_RESULT_OBJECT)) {
SSARepresentation* tgt_rep = move_result_mir->ssa_rep;
DCHECK(tgt_rep != NULL);
tgt_rep->fp_def[0] = true;
changed |= SetFp(tgt_rep->defs[0]);
if (shorty[0] == 'D') {
tgt_rep->fp_def[1] = true;
changed |= SetFp(tgt_rep->defs[1]);
}
}
}
int num_uses = mir->dalvikInsn.vA;
// If this is a non-static invoke, mark implicit "this"
if (((mir->dalvikInsn.opcode != Instruction::INVOKE_STATIC) &&
(mir->dalvikInsn.opcode != Instruction::INVOKE_STATIC_RANGE))) {
reg_location_[uses[next]].defined = true;
reg_location_[uses[next]].ref = true;
type_mismatch |= reg_location_[uses[next]].wide;
next++;
}
uint32_t cpos = 1;
if (strlen(shorty) > 1) {
for (int i = next; i < num_uses;) {
DCHECK_LT(cpos, strlen(shorty));
switch (shorty[cpos++]) {
case 'D':
ssa_rep->fp_use[i] = true;
ssa_rep->fp_use[i+1] = true;
reg_location_[uses[i]].wide = true;
reg_location_[uses[i+1]].wide = true;
reg_location_[uses[i+1]].high_word = true;
DCHECK_EQ(SRegToVReg(uses[i])+1, SRegToVReg(uses[i+1]));
i++;
break;
case 'J':
reg_location_[uses[i]].wide = true;
reg_location_[uses[i+1]].wide = true;
reg_location_[uses[i+1]].high_word = true;
DCHECK_EQ(SRegToVReg(uses[i])+1, SRegToVReg(uses[i+1]));
changed |= SetCore(uses[i]);
i++;
break;
case 'F':
type_mismatch |= reg_location_[uses[i]].wide;
ssa_rep->fp_use[i] = true;
break;
case 'L':
type_mismatch |= reg_location_[uses[i]].wide;
changed |= SetRef(uses[i]);
break;
default:
type_mismatch |= reg_location_[uses[i]].wide;
changed |= SetCore(uses[i]);
break;
}
i++;
}
}
}
for (int i = 0; ssa_rep->fp_use && i< ssa_rep->num_uses; i++) {
if (ssa_rep->fp_use[i]) {
changed |= SetFp(uses[i]);
}
}
for (int i = 0; ssa_rep->fp_def && i< ssa_rep->num_defs; i++) {
if (ssa_rep->fp_def[i]) {
changed |= SetFp(defs[i]);
}
}
// Special-case handling for moves & Phi
if (attrs & (DF_IS_MOVE | DF_NULL_TRANSFER_N)) {
/*
* If any of our inputs or outputs is defined, set all.
* Some ugliness related to Phi nodes and wide values.
* The Phi set will include all low words or all high
* words, so we have to treat them specially.
*/
bool is_phi = (static_cast<int>(mir->dalvikInsn.opcode) == kMirOpPhi);
RegLocation rl_temp = reg_location_[defs[0]];
bool defined_fp = rl_temp.defined && rl_temp.fp;
bool defined_core = rl_temp.defined && rl_temp.core;
bool defined_ref = rl_temp.defined && rl_temp.ref;
bool is_wide = rl_temp.wide || ((attrs & DF_A_WIDE) != 0);
bool is_high = is_phi && rl_temp.wide && rl_temp.high_word;
for (int i = 0; i < ssa_rep->num_uses; i++) {
rl_temp = reg_location_[uses[i]];
defined_fp |= rl_temp.defined && rl_temp.fp;
defined_core |= rl_temp.defined && rl_temp.core;
defined_ref |= rl_temp.defined && rl_temp.ref;
is_wide |= rl_temp.wide;
is_high |= is_phi && rl_temp.wide && rl_temp.high_word;
}
/*
* We don't normally expect to see a Dalvik register definition used both as a
* floating point and core value, though technically it could happen with constants.
* Until we have proper typing, detect this situation and disable register promotion
* (which relies on the distinction between core a fp usages).
*/
if ((defined_fp && (defined_core | defined_ref)) &&
((cu_->disable_opt & (1 << kPromoteRegs)) == 0)) {
LOG(WARNING) << PrettyMethod(cu_->method_idx, *cu_->dex_file)
<< " op at block " << bb->id
<< " has both fp and core/ref uses for same def.";
cu_->disable_opt |= (1 << kPromoteRegs);
}
changed |= SetFp(defs[0], defined_fp);
changed |= SetCore(defs[0], defined_core);
changed |= SetRef(defs[0], defined_ref);
changed |= SetWide(defs[0], is_wide);
changed |= SetHigh(defs[0], is_high);
if (attrs & DF_A_WIDE) {
changed |= SetWide(defs[1]);
changed |= SetHigh(defs[1]);
}
for (int i = 0; i < ssa_rep->num_uses; i++) {
changed |= SetFp(uses[i], defined_fp);
changed |= SetCore(uses[i], defined_core);
changed |= SetRef(uses[i], defined_ref);
changed |= SetWide(uses[i], is_wide);
changed |= SetHigh(uses[i], is_high);
}
if (attrs & DF_A_WIDE) {
DCHECK_EQ(ssa_rep->num_uses, 2);
changed |= SetWide(uses[1]);
changed |= SetHigh(uses[1]);
}
}
}
if (type_mismatch) {
LOG(WARNING) << "Deprecated dex type mismatch, interpreting "
<< PrettyMethod(cu_->method_idx, *cu_->dex_file);
LOG(INFO) << "@ 0x" << std::hex << mir->offset;
SetPuntToInterpreter(true);
}
return changed;
}
static const char* storage_name[] = {" Frame ", "PhysReg", " Spill "};
void MIRGraph::DumpRegLocTable(RegLocation* table, int count) {
// FIXME: Quick-specific. Move to Quick (and make a generic version for MIRGraph?
Mir2Lir* cg = static_cast<Mir2Lir*>(cu_->cg.get());
if (cg != NULL) {
for (int i = 0; i < count; i++) {
LOG(INFO) << StringPrintf("Loc[%02d] : %s, %c %c %c %c %c %c 0x%04x S%d",
table[i].orig_sreg, storage_name[table[i].location],
table[i].wide ? 'W' : 'N', table[i].defined ? 'D' : 'U',
table[i].fp ? 'F' : table[i].ref ? 'R' :'C',
table[i].is_const ? 'c' : 'n',
table[i].high_word ? 'H' : 'L', table[i].home ? 'h' : 't',
table[i].reg.GetRawBits(),
table[i].s_reg_low);
}
} else {
// Either pre-regalloc or Portable.
for (int i = 0; i < count; i++) {
LOG(INFO) << StringPrintf("Loc[%02d] : %s, %c %c %c %c %c %c S%d",
table[i].orig_sreg, storage_name[table[i].location],
table[i].wide ? 'W' : 'N', table[i].defined ? 'D' : 'U',
table[i].fp ? 'F' : table[i].ref ? 'R' :'C',
table[i].is_const ? 'c' : 'n',
table[i].high_word ? 'H' : 'L', table[i].home ? 'h' : 't',
table[i].s_reg_low);
}
}
}
// FIXME - will likely need to revisit all uses of this.
static const RegLocation fresh_loc = {kLocDalvikFrame, 0, 0, 0, 0, 0, 0, 0, 0,
RegStorage(), INVALID_SREG, INVALID_SREG};
void MIRGraph::InitRegLocations() {
/* Allocate the location map */
int max_regs = GetNumSSARegs() + GetMaxPossibleCompilerTemps();
RegLocation* loc = static_cast<RegLocation*>(arena_->Alloc(max_regs * sizeof(*loc),
kArenaAllocRegAlloc));
for (int i = 0; i < GetNumSSARegs(); i++) {
loc[i] = fresh_loc;
loc[i].s_reg_low = i;
loc[i].is_const = is_constant_v_->IsBitSet(i);
loc[i].wide = false;
}
/* Patch up the locations for the compiler temps */
GrowableArray<CompilerTemp*>::Iterator iter(&compiler_temps_);
for (CompilerTemp* ct = iter.Next(); ct != NULL; ct = iter.Next()) {
loc[ct->s_reg_low].location = kLocCompilerTemp;
loc[ct->s_reg_low].defined = true;
}
/* Treat Method* as a normal reference */
loc[GetMethodSReg()].ref = true;
reg_location_ = loc;
int num_regs = cu_->num_dalvik_registers;
/* Add types of incoming arguments based on signature */
int num_ins = cu_->num_ins;
if (num_ins > 0) {
int s_reg = num_regs - num_ins;
if ((cu_->access_flags & kAccStatic) == 0) {
// For non-static, skip past "this"
reg_location_[s_reg].defined = true;
reg_location_[s_reg].ref = true;
s_reg++;
}
const char* shorty = cu_->shorty;
int shorty_len = strlen(shorty);
for (int i = 1; i < shorty_len; i++) {
switch (shorty[i]) {
case 'D':
reg_location_[s_reg].wide = true;
reg_location_[s_reg+1].high_word = true;
reg_location_[s_reg+1].fp = true;
DCHECK_EQ(SRegToVReg(s_reg)+1, SRegToVReg(s_reg+1));
reg_location_[s_reg].fp = true;
reg_location_[s_reg].defined = true;
s_reg++;
break;
case 'J':
reg_location_[s_reg].wide = true;
reg_location_[s_reg+1].high_word = true;
DCHECK_EQ(SRegToVReg(s_reg)+1, SRegToVReg(s_reg+1));
reg_location_[s_reg].core = true;
reg_location_[s_reg].defined = true;
s_reg++;
break;
case 'F':
reg_location_[s_reg].fp = true;
reg_location_[s_reg].defined = true;
break;
case 'L':
reg_location_[s_reg].ref = true;
reg_location_[s_reg].defined = true;
break;
default:
reg_location_[s_reg].core = true;
reg_location_[s_reg].defined = true;
break;
}
s_reg++;
}
}
}
/*
* Set the s_reg_low field to refer to the pre-SSA name of the
* base Dalvik virtual register. Once we add a better register
* allocator, remove this remapping.
*/
#ifdef MTK_ART_COMMON
__attribute__((weak))
#endif
void MIRGraph::RemapRegLocations() {
for (int i = 0; i < GetNumSSARegs(); i++) {
if (reg_location_[i].location != kLocCompilerTemp) {
int orig_sreg = reg_location_[i].s_reg_low;
reg_location_[i].orig_sreg = orig_sreg;
reg_location_[i].s_reg_low = SRegToVReg(orig_sreg);
}
}
}
} // namespace art
| [
"[email protected]"
] | |
df0c6e86829ad53b3d1fef0a6fb5f33d2f5b147e | ab45de67f367fe254e8b4cae5f0f9e52cecaac78 | /kozDX/PixelShader.cpp | 1446b5d28f176d24c9f7eb77edaa2ecda5ba8f36 | [] | no_license | kozonoyuki/kozDX | 3e23ebc157fcf33fdc9c8e6f2f226737ade6ae97 | 96cf89d7be0c3c35d1c973ccbca83a1936ae12b4 | refs/heads/master | 2021-03-24T12:27:56.238957 | 2015-05-09T13:30:42 | 2015-05-09T13:30:42 | 27,296,073 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 1,442 | cpp | /**
* @file PixelShader.cpp
* @brief ピクセルシェーダをラップ
* @author kozonoyuki
* @date 11/29に書き始め
*/
#include "stdafx.h"
#include "PixelShader.h"
#include "Utility.h"
koz::PixelShader::PixelShader()
{
// デフォルト設定
m_EntryName = "PS";
m_ShaderVersion = "ps_4_0";
}
koz::PixelShader::~PixelShader()
{
}
HRESULT koz::PixelShader::Create(CComPtr<ID3D11Device> pDevice, std::string ShaderPath)
{
HRESULT hr = S_OK;
ID3D11PixelShader* pPixelShader = nullptr;
ID3DBlob* pBlob = nullptr;
hr = CompileShaderFromFile(StringToWcstring(ShaderPath), m_EntryName.c_str(), m_ShaderVersion.c_str(), &pBlob);
if (FAILED(hr))
{
MessageBox(nullptr, L"ピクセルシェーダをコンパイルできませんでした。", L"Error", MB_OK);
return hr;
}
hr = pDevice->CreatePixelShader(pBlob->GetBufferPointer(), pBlob->GetBufferSize(), nullptr, &pPixelShader);
if (FAILED(hr))
{
MessageBox(nullptr, L"ピクセルシェーダを作成することができませんでした。", L"Error", MB_OK);
return hr;
}
m_PixelShader.Attach(pPixelShader);
return hr;
}
void koz::PixelShader::SetEntryName(std::string EntryName)
{
m_EntryName = EntryName;
}
void koz::PixelShader::SetShaderVersion(std::string ShaderVersion)
{
m_ShaderVersion = ShaderVersion;
}
void koz::PixelShader::Set(CComPtr<ID3D11DeviceContext> pDeviceContext)
{
pDeviceContext->PSSetShader(m_PixelShader, nullptr, 0);
} | [
"[email protected]"
] | |
3b20e4b211effe0ad62ebeac288a5bcae65d6f96 | 97aab27d4410969e589ae408b2724d0faa5039e2 | /SDK/EXES/INSTALL VISUAL 6 SDK/INPUT/6.0_980820/MSDN/VCPP/SMPL/MSDN98/98VSa/1036/SAMPLES/VC98/atl/atltangram/atltangramcanvas/atltangramcanvasimpl.cpp | af476458b2e304cfdabcd3209eb21ff29537eefb | [] | no_license | FutureWang123/dreamcast-docs | 82e4226cb1915f8772418373d5cb517713f858e2 | 58027aeb669a80aa783a6d2cdcd2d161fd50d359 | refs/heads/master | 2021-10-26T00:04:25.414629 | 2018-08-10T21:20:37 | 2018-08-10T21:20:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,297 | cpp | // AtlTangramCanvasImpl.cpp : Implementation of CAtlTangramCanvas
//
// This is a part of the Active Template Library.
// Copyright (C) 1996-1998 Microsoft Corporation
// All rights reserved.
//
// This source code is only intended as a supplement to the
// Active Template Library Reference and related
// electronic documentation provided with the library.
// See these sources for detailed information regarding the
// Active Template Library product.
#include "stdafx.h"
#include "ATLTangramCanvas.h"
#include "AtlTangramCanvasImpl.h"
/////////////////////////////////////////////////////////////////////////////
// CAtlTangramCanvas
//
///////////////////////////////////////////////////////////
//
// Initialize
//
HRESULT CAtlTangramCanvas::Initialize(HWND hWnd, long cx, long cy)
{
// Hard coded to 8 bits per pixel.
int ibitcount = 8 ;
// Preconditions.
if ( hWnd == NULL || !::IsWindow(hWnd) || cx <= 0 || cy <= 0)
{
// Definsive code.
ASSERT(hWnd != NULL) ;
ASSERT(::IsWindow(hWnd)) ;
ASSERT(cx > 0);
ASSERT(cy > 0);
return E_INVALIDARG ;
}
// Cache a copy of the window handle.
m_hWnd = hWnd ;
// Destroy parts of objects if we are recreating it.
if ((m_hdc != NULL) || (m_hbmp != NULL))
{
// destroy() ;
}
// Save size for drawing later.
m_sizeDIB.cx = cx ;
m_sizeDIB.cy = cy ;
// Create a BITMAPINFOHEADER structure to describe the DIB
BITMAPINFOHEADER BIH ;
int iSize = sizeof(BITMAPINFOHEADER) ;
memset(&BIH, 0, iSize);
// Fill in the header info.
BIH.biSize = iSize;
BIH.biWidth = cx;
BIH.biHeight = cy;
BIH.biPlanes = 1;
BIH.biBitCount = ibitcount;
BIH.biCompression = BI_RGB;
// Create a new DC.
m_hdc = ::CreateCompatibleDC(NULL) ;
// Create the DIB section.
m_hbmp = CreateDIBSection( m_hdc,
(BITMAPINFO*)&BIH,
DIB_PAL_COLORS,
&m_pBits,
NULL,
0);
ASSERT(m_hbmp);
ASSERT(m_pBits);
// Select the new bitmap into the buffer DC
if (m_hbmp)
{
m_hbmOld = (HBITMAP)::SelectObject( m_hdc,
m_hbmp);
}
return S_OK ;
}
///////////////////////////////////////////////////////////
//
// Transfer the dib section to a DC.
// Called in response to paint and draw messages.
//
HRESULT CAtlTangramCanvas::Paint(HDC hdcDest, RECT rectUpdate)
{
// Preconditions
if ( hdcDest == NULL)
{
ASSERT(hdcDest != NULL) ;
return E_INVALIDARG ;
}
// Select in a palette if we have one.
HPALETTE hPalOld = NULL;
if (m_hPal)
{
hPalOld = ::SelectPalette(hdcDest, (HPALETTE)m_hPal, 0);
::RealizePalette(hdcDest);
}
// If the rectangle is empty or null, repaint the entire area.
RECT rect, rectNull ;
::SetRectEmpty(&rectNull) ;
::CopyRect(&rect, &rectUpdate) ;
if (::EqualRect(&rect, &rectNull) || ::IsRectEmpty(&rect))
{
// Note: you do not need to select the palette into
// the memory DC because the DIB section is using palette
// index values not colors
::BitBlt(hdcDest, 0, 0,
m_sizeDIB.cx, m_sizeDIB.cy,
m_hdc,
0,0,
SRCCOPY);
}
else
{
// Just repaint the updated area.
::BitBlt(hdcDest,
rect.left, rect.top,
rect.right - rect.left, rect.bottom - rect.top,
m_hdc,
rect.left, rect.top,
SRCCOPY);
}
// We are done with the palette
if (hPalOld)
{
::SelectPalette(hdcDest, hPalOld, 0);
}
return S_OK ;
}
///////////////////////////////////////////////////////////
//
// Update
//
HRESULT CAtlTangramCanvas::Update(RECT rectUpdate)
{
HDC hdcDest = ::GetDC(m_hWnd) ;
Paint(hdcDest, rectUpdate) ;
::ReleaseDC(m_hWnd, hdcDest);
return S_OK ;
}
///////////////////////////////////////////////////////////
//
// GetHDC
//
HRESULT CAtlTangramCanvas::GetHDC(HDC* phdc)
{
// Pre conditions.
if (!IsValidAddress(phdc, sizeof(HDC), TRUE))
{
ASSERT(0) ;
return E_FAIL ;
}
// Return device context.
*phdc = m_hdc ;
return S_OK ;
}
///////////////////////////////////////////////////////////
//
// Set the color table in the DIB section.
//
HRESULT __stdcall CAtlTangramCanvas::SetPalette(HPALETTE hPal)
{
if (hPal == NULL)
{
ASSERT(hPal != NULL);
return E_INVALIDARG ;
}
// Keep a copy of the palette around for painting.
m_hPal = hPal ;
// get the colors from the palette
int iColors = 0;
::GetObject(hPal, sizeof(iColors), &iColors) ;
ASSERT(iColors > 0);
PALETTEENTRY* pPE = new PALETTEENTRY[iColors];
::GetPaletteEntries(hPal, 0, iColors, pPE);
// Build a table of RGBQUADS
RGBQUAD* pRGB = new RGBQUAD[iColors];
ASSERT(pRGB);
for (int i = 0; i < iColors; i++) {
pRGB[i].rgbRed = pPE[i].peRed;
pRGB[i].rgbGreen = pPE[i].peGreen;
pRGB[i].rgbBlue = pPE[i].peBlue;
pRGB[i].rgbReserved = 0;
}
::SetDIBColorTable(m_hdc,
0, iColors,
pRGB);
delete [] pRGB;
delete [] pPE;
return S_OK ;
}
///////////////////////////////////////////////////////////
//
// Called when the main window gets a QueryNewPalette or a
// PaletteChanged message.
//
HRESULT __stdcall CAtlTangramCanvas::OnQueryNewPalette(HWND hWndReceived)
{
if (hWndReceived == NULL)
{
return E_FAIL ;
}
if (m_hPal)
{
HDC hdc = ::GetDC(hWndReceived) ;
::SelectPalette(hdc, m_hPal, FALSE) ;
UINT u = ::RealizePalette(hdc) ;
::ReleaseDC(hWndReceived, hdc) ;
if (u != 0)
{
::InvalidateRect(hWndReceived, NULL, TRUE) ;
}
}
return S_OK ;
} | [
"[email protected]"
] | |
fa204b67b49e4516fe5369b789ce0f62d26d26e6 | 9bf5f43c9adc4a7fdfe4a6c03e805a9623685171 | /SpaceRacer/Source/Asteroid.h | a1eeacfd73fab669c0ea3a130b917c44a9d8beaf | [] | no_license | caioteixeira/SpaceRacer | 8e4ba58c072139e91c9a5949b4c85a143ff6fdaf | ae31ba5203975f316b1a1bdddbf2b13318af62e0 | refs/heads/master | 2016-08-11T18:51:37.601961 | 2015-10-29T21:27:27 | 2015-10-29T21:27:27 | 45,133,433 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 292 | h | #pragma once
#include "Actor.h"
#include "AudioComponent.h"
class Asteroid : public Actor
{
DECL_ACTOR(Asteroid, Actor);
public:
Asteroid(Game & game);
AudioComponentPtr GetAudio(){ return mAudio; };
private:
AudioComponentPtr mAudio;
SoundPtr mExplosionSound;
};
DECL_PTR(Asteroid); | [
"[email protected]"
] | |
569110132e9afc7fc23df8574a02307f52c0e3df | f875f2ff25629091b2f234140891f407ef537608 | /aws-cpp-sdk-location/include/aws/location/model/CreateMapResult.h | 705bd7378c4303e9f4cef861873bce9204da20ce | [
"MIT",
"Apache-2.0",
"JSON"
] | permissive | Adam9911/aws-sdk-cpp | 39f0c057c25053929aec41ef8de81a9664c1a616 | da78cc54da7de3894af2742316cec2814832b3c1 | refs/heads/main | 2023-06-03T10:25:53.887456 | 2021-05-15T14:49:26 | 2021-05-15T14:49:26 | 367,572,100 | 0 | 0 | Apache-2.0 | 2021-05-15T07:52:14 | 2021-05-15T07:52:13 | null | UTF-8 | C++ | false | false | 6,255 | h | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#pragma once
#include <aws/location/LocationService_EXPORTS.h>
#include <aws/core/utils/DateTime.h>
#include <aws/core/utils/memory/stl/AWSString.h>
#include <utility>
namespace Aws
{
template<typename RESULT_TYPE>
class AmazonWebServiceResult;
namespace Utils
{
namespace Json
{
class JsonValue;
} // namespace Json
} // namespace Utils
namespace LocationService
{
namespace Model
{
class AWS_LOCATIONSERVICE_API CreateMapResult
{
public:
CreateMapResult();
CreateMapResult(const Aws::AmazonWebServiceResult<Aws::Utils::Json::JsonValue>& result);
CreateMapResult& operator=(const Aws::AmazonWebServiceResult<Aws::Utils::Json::JsonValue>& result);
/**
* <p>The timestamp for when the map resource was created in <a
* href="https://www.iso.org/iso-8601-date-and-time-format.html">ISO 8601</a>
* format: <code>YYYY-MM-DDThh:mm:ss.sssZ</code>.</p>
*/
inline const Aws::Utils::DateTime& GetCreateTime() const{ return m_createTime; }
/**
* <p>The timestamp for when the map resource was created in <a
* href="https://www.iso.org/iso-8601-date-and-time-format.html">ISO 8601</a>
* format: <code>YYYY-MM-DDThh:mm:ss.sssZ</code>.</p>
*/
inline void SetCreateTime(const Aws::Utils::DateTime& value) { m_createTime = value; }
/**
* <p>The timestamp for when the map resource was created in <a
* href="https://www.iso.org/iso-8601-date-and-time-format.html">ISO 8601</a>
* format: <code>YYYY-MM-DDThh:mm:ss.sssZ</code>.</p>
*/
inline void SetCreateTime(Aws::Utils::DateTime&& value) { m_createTime = std::move(value); }
/**
* <p>The timestamp for when the map resource was created in <a
* href="https://www.iso.org/iso-8601-date-and-time-format.html">ISO 8601</a>
* format: <code>YYYY-MM-DDThh:mm:ss.sssZ</code>.</p>
*/
inline CreateMapResult& WithCreateTime(const Aws::Utils::DateTime& value) { SetCreateTime(value); return *this;}
/**
* <p>The timestamp for when the map resource was created in <a
* href="https://www.iso.org/iso-8601-date-and-time-format.html">ISO 8601</a>
* format: <code>YYYY-MM-DDThh:mm:ss.sssZ</code>.</p>
*/
inline CreateMapResult& WithCreateTime(Aws::Utils::DateTime&& value) { SetCreateTime(std::move(value)); return *this;}
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline const Aws::String& GetMapArn() const{ return m_mapArn; }
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline void SetMapArn(const Aws::String& value) { m_mapArn = value; }
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline void SetMapArn(Aws::String&& value) { m_mapArn = std::move(value); }
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline void SetMapArn(const char* value) { m_mapArn.assign(value); }
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline CreateMapResult& WithMapArn(const Aws::String& value) { SetMapArn(value); return *this;}
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline CreateMapResult& WithMapArn(Aws::String&& value) { SetMapArn(std::move(value)); return *this;}
/**
* <p>The Amazon Resource Name (ARN) for the map resource. Used when you need to
* specify a resource across all AWS.</p> <ul> <li> <p>Format example:
* <code>arn:partition:service:region:account-id:resource-type:resource-id</code>
* </p> </li> </ul>
*/
inline CreateMapResult& WithMapArn(const char* value) { SetMapArn(value); return *this;}
/**
* <p>The name of the map resource.</p>
*/
inline const Aws::String& GetMapName() const{ return m_mapName; }
/**
* <p>The name of the map resource.</p>
*/
inline void SetMapName(const Aws::String& value) { m_mapName = value; }
/**
* <p>The name of the map resource.</p>
*/
inline void SetMapName(Aws::String&& value) { m_mapName = std::move(value); }
/**
* <p>The name of the map resource.</p>
*/
inline void SetMapName(const char* value) { m_mapName.assign(value); }
/**
* <p>The name of the map resource.</p>
*/
inline CreateMapResult& WithMapName(const Aws::String& value) { SetMapName(value); return *this;}
/**
* <p>The name of the map resource.</p>
*/
inline CreateMapResult& WithMapName(Aws::String&& value) { SetMapName(std::move(value)); return *this;}
/**
* <p>The name of the map resource.</p>
*/
inline CreateMapResult& WithMapName(const char* value) { SetMapName(value); return *this;}
private:
Aws::Utils::DateTime m_createTime;
Aws::String m_mapArn;
Aws::String m_mapName;
};
} // namespace Model
} // namespace LocationService
} // namespace Aws
| [
"[email protected]"
] | |
e0e72bd21307ec980404e79d47cb506e837cfeb8 | f66293cb97cee6438fa800338b9e226058120711 | /UVa/10079-PizzaCutting.cpp | ff2c57baf44c8e15b8454a9c6b16be395b5a6f66 | [] | no_license | FarihaUpoma/Programming-Codes | 0734f295526d1a98bd3515972dbf82ac76143f44 | 647ce64a8f69bb2193ffd0ccb68da65a6a71162a | refs/heads/master | 2021-08-26T08:12:05.935212 | 2017-11-22T11:26:29 | 2017-11-22T11:26:29 | 111,667,728 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 395 | cpp | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <ctype.h>
#include <iostream>
using namespace std;
#define eps 1e-10
#define PI acos(-1)
int main()
{
long long int n, x;
while(scanf("%lld", &n))
{
if(n<0) break;
x= n*(n+1)/2 + 1;
printf("%lld\n", x);
}
return 0;
}
| [
"[email protected]"
] | |
a2987ea72ba13b851be2b6fab3aad64df7f82e95 | c01229900ffcc6aeb98c3d49f1ef63d699a2f12b | /include/game_renderer.hpp | ea9a15d8ce73a1b9ec21f6b12906185b63eca890 | [
"MIT"
] | permissive | rosskidson/nestris_x86 | 32dda38de2e1acbe786dc842d40bf9131fb1c25e | ce5085436ff2c04f8f760c2d88469f77794dd6c3 | refs/heads/master | 2023-03-11T19:20:30.225094 | 2021-01-10T21:29:08 | 2021-01-10T21:29:08 | 325,801,988 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,563 | hpp | #pragma once
#include <memory>
#include <set>
#include "assets.hpp"
#include "das.hpp"
#include "drawers/pixel_drawing_interface.hpp"
#include "game_states.hpp"
#include "key_defines.hpp"
#include "statistics.hpp"
#include "tetromino.hpp"
namespace nestris_x86 {
class GameRenderer {
public:
GameRenderer(std::unique_ptr<PixelDrawingInterface> &&drawer,
const std::shared_ptr<SpriteProvider> &sprite_provider,
const std::string &sprites_path);
void renderGameState(const GameState<> &state, const Statistics &stats,
const bool render_controls, const bool render_das_bar,
const StatisticsMode &statistics_mode, const KeyEvents &key_events,
const Das &das_processor);
void renderPaused() const;
void doTetrisFlash(const int &line_clear_frame_number) const;
void startNewGame();
private:
template <typename GridContainer>
void renderGrid(const int x_start, const int y_start, const GridContainer &grid, const int level,
const int x_spacing = 8, const int y_spacing = 8, const int color = 1) const {
for (int i = 0; i < grid.size(); ++i) {
for (int j = 0; j < grid[i].size(); ++j) {
if (grid[i][j] == 0) {
continue;
}
drawer_->drawSprite(x_start + i * x_spacing, y_start + j * y_spacing,
getBlockSprite(level, grid[i][j] * color));
}
}
}
olc::Sprite *getBlockSprite(const int level, const int color) const;
void renderNesStatsics(const GameState<> &state, const Statistics &statistics);
void renderTreyVisionStatistics(const GameState<> &state, const Statistics &statistics);
void renderBackground();
void renderText(const GameState<> &state, const Statistics &stats) const;
void renderNextTetromino(const Tetromino &next_tetromino, const int level) const;
void renderDasBar(const int das_counter, const Das &das_processor,
const PixelDrawingInterface::Coords &das_box_pos) const;
void renderControls(const GameState<> &state, const KeyEvents &key_events,
const PixelDrawingInterface::Coords &control_position) const;
void renderEntryDelay(const bool delay_entry,
const PixelDrawingInterface::Coords &position) const;
std::unique_ptr<PixelDrawingInterface> drawer_;
std::shared_ptr<SpriteProvider> sprite_provider_;
std::vector<std::vector<std::unique_ptr<olc::Sprite>>> block_sprites_;
bool background_rendered_;
};
} // namespace nestris_x86
| [
"[email protected]"
] | |
044ddf326c99fbde0b07b84766db3134f65aaf8a | dfe01ef79596f1c9f12c6ba6fe46d703369054fe | /renderdoc/driver/d3d12/d3d12_stringise.cpp | 551cbb9f29db2bedac8daadf5e8bc03127c2a40e | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | galek/renderdoc | 330b209da7618e38df595e8d3c5ac5f9e5734853 | 39d31e880d9d8997372f0121bec8950e9b4e4442 | refs/heads/master | 2021-11-25T06:15:53.681934 | 2021-10-28T09:49:15 | 2021-10-28T10:24:46 | 40,795,914 | 0 | 0 | null | 2015-08-16T02:17:03 | 2015-08-16T02:17:03 | null | UTF-8 | C++ | false | false | 47,799 | cpp | /******************************************************************************
* The MIT License (MIT)
*
* Copyright (c) 2019-2021 Baldur Karlsson
*
* 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 "d3d12_common.h"
#include "d3d12_resources.h"
template <>
rdcstr DoStringise(const D3D12Chunk &el)
{
RDCCOMPILE_ASSERT((uint32_t)D3D12Chunk::Max == 1114, "Chunks changed without updating names");
BEGIN_ENUM_STRINGISE(D3D12Chunk)
{
STRINGISE_ENUM_CLASS_NAMED(SetName, "ID3D12Resource::SetName");
STRINGISE_ENUM_CLASS_NAMED(PushMarker, "ID3D12GraphicsCommandList::BeginEvent");
STRINGISE_ENUM_CLASS_NAMED(SetMarker, "ID3D12GraphicsCommandList::SetMarker");
STRINGISE_ENUM_CLASS_NAMED(PopMarker, "ID3D12GraphicsCommandList::EndEvent");
STRINGISE_ENUM_CLASS_NAMED(SetShaderDebugPath, "Internal::SetShaderDebugPath");
STRINGISE_ENUM_CLASS_NAMED(CreateSwapBuffer, "IDXGISwapChain::GetBuffer");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommandQueue, "ID3D12Device::CreateCommandQueue");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommandAllocator,
"ID3D12Device::CreateCommandAllocator");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommandList, "ID3D12Device::CreateCommandList");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateGraphicsPipeline,
"ID3D12Device::CreateGraphicsPipeline");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateComputePipeline, "ID3D12Device::CreateComputePipeline");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateDescriptorHeap, "ID3D12Device::CreateDescriptorHeap");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateRootSignature, "ID3D12Device::CreateRootSignature");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommandSignature,
"ID3D12Device::CreateCommandSignature");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateHeap, "ID3D12Device::CreateHeap");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommittedResource,
"ID3D12Device::CreateCommittedResource");
STRINGISE_ENUM_CLASS_NAMED(Device_CreatePlacedResource, "ID3D12Device::CreatePlacedResource");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateQueryHeap, "ID3D12Device::CreateQueryHeap");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateFence, "ID3D12Device::CreateFence");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateReservedResource,
"ID3D12Device::CreateReservedResource");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateConstantBufferView,
"ID3D12Device::CreateConstantBufferView");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateShaderResourceView,
"ID3D12Device::CreateShaderResourceView");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateUnorderedAccessView,
"ID3D12Device::CreateUnorderedAccessView");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateRenderTargetView,
"ID3D12Device::CreateRenderTargetView");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateDepthStencilView,
"ID3D12Device::CreateDepthStencilView");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateSampler, "ID3D12Device::CreateSampler");
STRINGISE_ENUM_CLASS_NAMED(Device_CopyDescriptors, "ID3D12Device::CopyDescriptors");
STRINGISE_ENUM_CLASS_NAMED(Device_CopyDescriptorsSimple, "ID3D12Device::CopyDescriptorsSimple");
STRINGISE_ENUM_CLASS_NAMED(Device_OpenSharedHandle, "ID3D12Device::OpenSharedHandle");
STRINGISE_ENUM_CLASS_NAMED(Queue_ExecuteCommandLists,
"ID3D12CommandQueue::ExecuteCommandLists");
STRINGISE_ENUM_CLASS_NAMED(Queue_Signal, "ID3D12CommandQueue::Signal");
STRINGISE_ENUM_CLASS_NAMED(Queue_Wait, "ID3D12CommandQueue::Wait");
STRINGISE_ENUM_CLASS_NAMED(Queue_UpdateTileMappings, "ID3D12CommandQueue::UpdateTileMappings");
STRINGISE_ENUM_CLASS_NAMED(Queue_CopyTileMappings, "ID3D12CommandQueue::CopyTileMappings");
STRINGISE_ENUM_CLASS_NAMED(List_Close, "ID3D12GraphicsCommandList::Close");
STRINGISE_ENUM_CLASS_NAMED(List_Reset, "ID3D12GraphicsCommandList::Reset");
STRINGISE_ENUM_CLASS_NAMED(List_ResourceBarrier, "ID3D12GraphicsCommandList::ResourceBarrier");
STRINGISE_ENUM_CLASS_NAMED(List_BeginQuery, "ID3D12GraphicsCommandList::BeginQuery");
STRINGISE_ENUM_CLASS_NAMED(List_EndQuery, "ID3D12GraphicsCommandList::EndQuery");
STRINGISE_ENUM_CLASS_NAMED(List_ResolveQueryData,
"ID3D12GraphicsCommandList::ResolveQueryData");
STRINGISE_ENUM_CLASS_NAMED(List_SetPredication, "ID3D12GraphicsCommandList::SetPredication");
STRINGISE_ENUM_CLASS_NAMED(List_DrawIndexedInstanced,
"ID3D12GraphicsCommandList::DrawIndexedInstanced");
STRINGISE_ENUM_CLASS_NAMED(List_DrawInstanced, "ID3D12GraphicsCommandList::DrawInstanced");
STRINGISE_ENUM_CLASS_NAMED(List_Dispatch, "ID3D12GraphicsCommandList::Dispatch");
STRINGISE_ENUM_CLASS_NAMED(List_ExecuteIndirect, "ID3D12GraphicsCommandList::ExecuteIndirect");
STRINGISE_ENUM_CLASS_NAMED(List_ExecuteBundle, "ID3D12GraphicsCommandList::ExecuteBundle");
STRINGISE_ENUM_CLASS_NAMED(List_CopyBufferRegion,
"ID3D12GraphicsCommandList::CopyBufferRegion");
STRINGISE_ENUM_CLASS_NAMED(List_CopyTextureRegion,
"ID3D12GraphicsCommandList::CopyTextureRegion");
STRINGISE_ENUM_CLASS_NAMED(List_CopyResource, "ID3D12GraphicsCommandList::CopyResource");
STRINGISE_ENUM_CLASS_NAMED(List_ResolveSubresource,
"ID3D12GraphicsCommandList::ResolveSubresource");
STRINGISE_ENUM_CLASS_NAMED(List_ClearRenderTargetView,
"ID3D12GraphicsCommandList::ClearRenderTargetView");
STRINGISE_ENUM_CLASS_NAMED(List_ClearDepthStencilView,
"ID3D12GraphicsCommandList::ClearDepthStencilView");
STRINGISE_ENUM_CLASS_NAMED(List_ClearUnorderedAccessViewUint,
"ID3D12GraphicsCommandList::ClearUnorderedAccessViewUint");
STRINGISE_ENUM_CLASS_NAMED(List_ClearUnorderedAccessViewFloat,
"ID3D12GraphicsCommandList::ClearUnorderedAccessViewFloat");
STRINGISE_ENUM_CLASS_NAMED(List_DiscardResource, "ID3D12GraphicsCommandList::DiscardResource");
STRINGISE_ENUM_CLASS_NAMED(List_IASetPrimitiveTopology,
"ID3D12GraphicsCommandList::IASetPrimitiveTopology");
STRINGISE_ENUM_CLASS_NAMED(List_IASetIndexBuffer,
"ID3D12GraphicsCommandList::IASetIndexBuffer");
STRINGISE_ENUM_CLASS_NAMED(List_IASetVertexBuffers,
"ID3D12GraphicsCommandList::IASetVertexBuffers");
STRINGISE_ENUM_CLASS_NAMED(List_SOSetTargets, "ID3D12GraphicsCommandList::SOSetTargets");
STRINGISE_ENUM_CLASS_NAMED(List_RSSetViewports, "ID3D12GraphicsCommandList::RSSetViewports");
STRINGISE_ENUM_CLASS_NAMED(List_RSSetScissorRects,
"ID3D12GraphicsCommandList::RSSetScissorRects");
STRINGISE_ENUM_CLASS_NAMED(List_SetPipelineState,
"ID3D12GraphicsCommandList::SetPipelineState");
STRINGISE_ENUM_CLASS_NAMED(List_SetDescriptorHeaps,
"ID3D12GraphicsCommandList::SetDescriptorHeaps");
STRINGISE_ENUM_CLASS_NAMED(List_OMSetRenderTargets,
"ID3D12GraphicsCommandList::OMSetRenderTargets");
STRINGISE_ENUM_CLASS_NAMED(List_OMSetStencilRef, "ID3D12GraphicsCommandList::OMSetStencilRef");
STRINGISE_ENUM_CLASS_NAMED(List_OMSetBlendFactor,
"ID3D12GraphicsCommandList::OMSetBlendFactor");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRootDescriptorTable,
"ID3D12GraphicsCommandList::SetGraphicsRootDescriptorTable");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRootSignature,
"ID3D12GraphicsCommandList::SetGraphicsRootSignature");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRoot32BitConstant,
"ID3D12GraphicsCommandList::SetGraphicsRoot32BitConstant");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRoot32BitConstants,
"ID3D12GraphicsCommandList::SetGraphicsRoot32BitConstants");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRootConstantBufferView,
"ID3D12GraphicsCommandList::SetGraphicsRootConstantBufferView");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRootShaderResourceView,
"ID3D12GraphicsCommandList::SetGraphicsRootShaderResourceView");
STRINGISE_ENUM_CLASS_NAMED(List_SetGraphicsRootUnorderedAccessView,
"ID3D12GraphicsCommandList::SetGraphicsRootUnorderedAccessView");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRootDescriptorTable,
"ID3D12GraphicsCommandList::SetComputeRootDescriptorTable");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRootSignature,
"ID3D12GraphicsCommandList::SetComputeRootSignature");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRoot32BitConstant,
"ID3D12GraphicsCommandList::SetComputeRoot32BitConstant");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRoot32BitConstants,
"ID3D12GraphicsCommandList::SetComputeRoot32BitConstants");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRootConstantBufferView,
"ID3D12GraphicsCommandList::SetComputeRootConstantBufferView");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRootShaderResourceView,
"ID3D12GraphicsCommandList::SetComputeRootShaderResourceView");
STRINGISE_ENUM_CLASS_NAMED(List_SetComputeRootUnorderedAccessView,
"ID3D12GraphicsCommandList::SetComputeRootUnorderedAccessView");
STRINGISE_ENUM_CLASS_NAMED(List_CopyTiles, "ID3D12GraphicsCommandList::CopyTiles");
STRINGISE_ENUM_CLASS_NAMED(Resource_Unmap, "ID3D12Resource::Unmap");
STRINGISE_ENUM_CLASS_NAMED(Resource_WriteToSubresource, "ID3D12Resource::WriteToSubresource");
STRINGISE_ENUM_CLASS_NAMED(List_IndirectSubCommand, "Indirect Sub-command");
STRINGISE_ENUM_CLASS_NAMED(Queue_BeginEvent, "ID3D12CommandQueue::BeginEvent");
STRINGISE_ENUM_CLASS_NAMED(Queue_SetMarker, "ID3D12CommandQueue::SetMarker");
STRINGISE_ENUM_CLASS_NAMED(Queue_EndEvent, "ID3D12CommandQueue::EndEvent");
STRINGISE_ENUM_CLASS_NAMED(Device_CreatePipelineState, "ID3D12Device2::CreatePipelineState");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateHeapFromAddress,
"ID3D12Device3::OpenExistingHeapFromAddress");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateHeapFromFileMapping,
"ID3D12Device3::OpenExistingHeapFromFileMapping");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommandList1, "ID3D12Device4::CreateCommandList1");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommittedResource1,
"ID3D12Device4::CreateCommittedResource1");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateHeap1, "ID3D12Device4::CreateHeap1");
STRINGISE_ENUM_CLASS_NAMED(List_AtomicCopyBufferUINT,
"ID3D12GraphicsCommandList1::AtomicCopyBufferUINT");
STRINGISE_ENUM_CLASS_NAMED(List_AtomicCopyBufferUINT64,
"ID3D12GraphicsCommandList1::AtomicCopyBufferUINT64");
STRINGISE_ENUM_CLASS_NAMED(List_OMSetDepthBounds,
"ID3D12GraphicsCommandList1::OMSetDepthBounds");
STRINGISE_ENUM_CLASS_NAMED(List_ResolveSubresourceRegion,
"ID3D12GraphicsCommandList1::ResolveSubresourceRegion");
STRINGISE_ENUM_CLASS_NAMED(List_SetSamplePositions,
"ID3D12GraphicsCommandList1::SetSamplePositions");
STRINGISE_ENUM_CLASS_NAMED(List_SetViewInstanceMask,
"ID3D12GraphicsCommandList1::SetViewInstanceMask");
STRINGISE_ENUM_CLASS_NAMED(List_WriteBufferImmediate,
"ID3D12GraphicsCommandList2::WriteBufferImmediate");
STRINGISE_ENUM_CLASS_NAMED(List_BeginRenderPass, "ID3D12GraphicsCommandList4::BeginRenderPass");
STRINGISE_ENUM_CLASS_NAMED(List_EndRenderPass, "ID3D12GraphicsCommandList4::EndRenderPass");
STRINGISE_ENUM_CLASS_NAMED(List_RSSetShadingRate,
"ID3D12GraphicsCommandList5::RSSetShadingRate");
STRINGISE_ENUM_CLASS_NAMED(List_RSSetShadingRateImage,
"ID3D12GraphicsCommandList5::RSSetShadingRateImage");
STRINGISE_ENUM_CLASS_NAMED(Device_ExternalDXGIResource, "External DXGI Resource import");
STRINGISE_ENUM_CLASS_NAMED(Swapchain_Present, "IDXGISwapChain::Present");
STRINGISE_ENUM_CLASS_NAMED(List_ClearState, "ID3D12GraphicsCommandList::ClearState");
STRINGISE_ENUM_CLASS_NAMED(CompatDevice_CreateSharedResource,
"ID3D12CompatibilityDevice::CreateSharedResource");
STRINGISE_ENUM_CLASS_NAMED(CompatDevice_CreateSharedHeap,
"ID3D12CompatibilityDevice::CreateSharedHeap");
STRINGISE_ENUM_CLASS_NAMED(SetShaderExtUAV, "Vendor Extension: Set magic shader UAV slot");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommittedResource2,
"ID3D12Device8::CreateCommittedResource2");
STRINGISE_ENUM_CLASS_NAMED(Device_CreatePlacedResource1,
"ID3D12Device8::CreatePlacedResource1");
STRINGISE_ENUM_CLASS_NAMED(Device_CreateCommandQueue1, "ID3D12Device9::CreateCommandQueue1");
STRINGISE_ENUM_CLASS_NAMED(CoherentMapWrite, "Internal::Coherent Mapped Memory Write");
STRINGISE_ENUM_CLASS_NAMED(Max, "Max Chunk");
}
END_ENUM_STRINGISE()
}
template <>
rdcstr DoStringise(const D3D12DescriptorType &el)
{
if((uint32_t)el < (uint32_t)D3D12DescriptorType::CBV)
return "Sampler";
BEGIN_ENUM_STRINGISE(D3D12DescriptorType);
{
STRINGISE_ENUM_CLASS_NAMED(CBV, "CBV");
STRINGISE_ENUM_CLASS_NAMED(SRV, "SRV");
STRINGISE_ENUM_CLASS_NAMED(UAV, "UAV");
STRINGISE_ENUM_CLASS_NAMED(RTV, "RTV");
STRINGISE_ENUM_CLASS_NAMED(DSV, "DSV");
STRINGISE_ENUM_CLASS_NAMED(Undefined, "Undefined");
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12ResourceType &el)
{
BEGIN_ENUM_STRINGISE(D3D12ResourceType);
{
STRINGISE_ENUM_NAMED(Resource_Device, "Device");
STRINGISE_ENUM_NAMED(Resource_Unknown, "Unknown");
STRINGISE_ENUM_NAMED(Resource_CommandAllocator, "Command Allocator");
STRINGISE_ENUM_NAMED(Resource_CommandQueue, "Command Queue");
STRINGISE_ENUM_NAMED(Resource_CommandSignature, "Command Signature");
STRINGISE_ENUM_NAMED(Resource_DescriptorHeap, "Descriptor Heap");
STRINGISE_ENUM_NAMED(Resource_Fence, "Fence");
STRINGISE_ENUM_NAMED(Resource_Heap, "Heap");
STRINGISE_ENUM_NAMED(Resource_PipelineState, "Pipeline State");
STRINGISE_ENUM_NAMED(Resource_QueryHeap, "Query Heap");
STRINGISE_ENUM_NAMED(Resource_Resource, "Resource");
STRINGISE_ENUM_NAMED(Resource_GraphicsCommandList, "Graphics CommandList");
STRINGISE_ENUM_NAMED(Resource_RootSignature, "Root Signature");
STRINGISE_ENUM_NAMED(Resource_PipelineLibrary, "Pipeline Library");
STRINGISE_ENUM_NAMED(Resource_ProtectedResourceSession, "Protected Resource Session");
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_HEAP_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_HEAP_TYPE);
{
STRINGISE_ENUM(D3D12_HEAP_TYPE_DEFAULT)
STRINGISE_ENUM(D3D12_HEAP_TYPE_UPLOAD)
STRINGISE_ENUM(D3D12_HEAP_TYPE_READBACK)
STRINGISE_ENUM(D3D12_HEAP_TYPE_CUSTOM)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_CPU_PAGE_PROPERTY &el)
{
BEGIN_ENUM_STRINGISE(D3D12_CPU_PAGE_PROPERTY);
{
STRINGISE_ENUM(D3D12_CPU_PAGE_PROPERTY_UNKNOWN)
STRINGISE_ENUM(D3D12_CPU_PAGE_PROPERTY_NOT_AVAILABLE)
STRINGISE_ENUM(D3D12_CPU_PAGE_PROPERTY_WRITE_COMBINE)
STRINGISE_ENUM(D3D12_CPU_PAGE_PROPERTY_WRITE_BACK)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_MEMORY_POOL &el)
{
BEGIN_ENUM_STRINGISE(D3D12_MEMORY_POOL);
{
STRINGISE_ENUM(D3D12_MEMORY_POOL_UNKNOWN)
STRINGISE_ENUM(D3D12_MEMORY_POOL_L0)
STRINGISE_ENUM(D3D12_MEMORY_POOL_L1)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_QUERY_HEAP_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_QUERY_HEAP_TYPE);
{
STRINGISE_ENUM(D3D12_QUERY_HEAP_TYPE_OCCLUSION)
STRINGISE_ENUM(D3D12_QUERY_HEAP_TYPE_TIMESTAMP)
STRINGISE_ENUM(D3D12_QUERY_HEAP_TYPE_PIPELINE_STATISTICS)
STRINGISE_ENUM(D3D12_QUERY_HEAP_TYPE_SO_STATISTICS)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_QUERY_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_QUERY_TYPE);
{
STRINGISE_ENUM(D3D12_QUERY_TYPE_OCCLUSION)
STRINGISE_ENUM(D3D12_QUERY_TYPE_BINARY_OCCLUSION)
STRINGISE_ENUM(D3D12_QUERY_TYPE_TIMESTAMP)
STRINGISE_ENUM(D3D12_QUERY_TYPE_PIPELINE_STATISTICS)
STRINGISE_ENUM(D3D12_QUERY_TYPE_SO_STATISTICS_STREAM0)
STRINGISE_ENUM(D3D12_QUERY_TYPE_SO_STATISTICS_STREAM1)
STRINGISE_ENUM(D3D12_QUERY_TYPE_SO_STATISTICS_STREAM2)
STRINGISE_ENUM(D3D12_QUERY_TYPE_SO_STATISTICS_STREAM3)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_PREDICATION_OP &el)
{
BEGIN_ENUM_STRINGISE(D3D12_PREDICATION_OP);
{
STRINGISE_ENUM(D3D12_PREDICATION_OP_EQUAL_ZERO)
STRINGISE_ENUM(D3D12_PREDICATION_OP_NOT_EQUAL_ZERO)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DESCRIPTOR_HEAP_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_DESCRIPTOR_HEAP_TYPE);
{
STRINGISE_ENUM(D3D12_DESCRIPTOR_HEAP_TYPE_CBV_SRV_UAV)
STRINGISE_ENUM(D3D12_DESCRIPTOR_HEAP_TYPE_SAMPLER)
STRINGISE_ENUM(D3D12_DESCRIPTOR_HEAP_TYPE_RTV)
STRINGISE_ENUM(D3D12_DESCRIPTOR_HEAP_TYPE_DSV)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RESOURCE_BARRIER_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_RESOURCE_BARRIER_TYPE);
{
STRINGISE_ENUM(D3D12_RESOURCE_BARRIER_TYPE_TRANSITION)
STRINGISE_ENUM(D3D12_RESOURCE_BARRIER_TYPE_ALIASING)
STRINGISE_ENUM(D3D12_RESOURCE_BARRIER_TYPE_UAV)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_SRV_DIMENSION &el)
{
BEGIN_ENUM_STRINGISE(D3D12_SRV_DIMENSION);
{
STRINGISE_ENUM(D3D12_SRV_DIMENSION_UNKNOWN)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_BUFFER)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE1D)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE1DARRAY)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE2D)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE2DARRAY)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE2DMS)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE2DMSARRAY)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURE3D)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURECUBE)
STRINGISE_ENUM(D3D12_SRV_DIMENSION_TEXTURECUBEARRAY)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RTV_DIMENSION &el)
{
BEGIN_ENUM_STRINGISE(D3D12_RTV_DIMENSION);
{
STRINGISE_ENUM(D3D12_RTV_DIMENSION_UNKNOWN)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_BUFFER)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE1D)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE1DARRAY)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE2D)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE2DARRAY)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE2DMS)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE2DMSARRAY)
STRINGISE_ENUM(D3D12_RTV_DIMENSION_TEXTURE3D)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_UAV_DIMENSION &el)
{
BEGIN_ENUM_STRINGISE(D3D12_UAV_DIMENSION);
{
STRINGISE_ENUM(D3D12_UAV_DIMENSION_BUFFER)
STRINGISE_ENUM(D3D12_UAV_DIMENSION_TEXTURE1D)
STRINGISE_ENUM(D3D12_UAV_DIMENSION_TEXTURE1DARRAY)
STRINGISE_ENUM(D3D12_UAV_DIMENSION_TEXTURE2D)
STRINGISE_ENUM(D3D12_UAV_DIMENSION_TEXTURE2DARRAY)
STRINGISE_ENUM(D3D12_UAV_DIMENSION_TEXTURE3D)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DSV_DIMENSION &el)
{
BEGIN_ENUM_STRINGISE(D3D12_DSV_DIMENSION);
{
STRINGISE_ENUM(D3D12_DSV_DIMENSION_UNKNOWN)
STRINGISE_ENUM(D3D12_DSV_DIMENSION_TEXTURE1D)
STRINGISE_ENUM(D3D12_DSV_DIMENSION_TEXTURE1DARRAY)
STRINGISE_ENUM(D3D12_DSV_DIMENSION_TEXTURE2D)
STRINGISE_ENUM(D3D12_DSV_DIMENSION_TEXTURE2DARRAY)
STRINGISE_ENUM(D3D12_DSV_DIMENSION_TEXTURE2DMS)
STRINGISE_ENUM(D3D12_DSV_DIMENSION_TEXTURE2DMSARRAY)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_FILTER &el)
{
BEGIN_ENUM_STRINGISE(D3D12_FILTER);
{
STRINGISE_ENUM(D3D12_FILTER_MIN_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MIN_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MIN_POINT_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MIN_POINT_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MIN_LINEAR_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MIN_LINEAR_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MIN_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MIN_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_ANISOTROPIC);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_POINT_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_POINT_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_LINEAR_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_LINEAR_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_MIN_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_COMPARISON_ANISOTROPIC);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_POINT_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_POINT_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_LINEAR_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_LINEAR_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_MIN_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MINIMUM_ANISOTROPIC);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_POINT_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_POINT_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_LINEAR_MAG_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_LINEAR_MAG_POINT_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_MAG_LINEAR_MIP_POINT);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_MIN_MAG_MIP_LINEAR);
STRINGISE_ENUM(D3D12_FILTER_MAXIMUM_ANISOTROPIC);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TEXTURE_ADDRESS_MODE &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_TEXTURE_ADDRESS_MODE);
{
STRINGISE_ENUM(D3D12_TEXTURE_ADDRESS_MODE_WRAP);
STRINGISE_ENUM(D3D12_TEXTURE_ADDRESS_MODE_MIRROR);
STRINGISE_ENUM(D3D12_TEXTURE_ADDRESS_MODE_CLAMP);
STRINGISE_ENUM(D3D12_TEXTURE_ADDRESS_MODE_BORDER);
STRINGISE_ENUM(D3D12_TEXTURE_ADDRESS_MODE_MIRROR_ONCE);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_BLEND &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_BLEND);
{
STRINGISE_ENUM(D3D12_BLEND_ZERO);
STRINGISE_ENUM(D3D12_BLEND_ONE);
STRINGISE_ENUM(D3D12_BLEND_SRC_COLOR);
STRINGISE_ENUM(D3D12_BLEND_INV_SRC_COLOR);
STRINGISE_ENUM(D3D12_BLEND_SRC_ALPHA);
STRINGISE_ENUM(D3D12_BLEND_INV_SRC_ALPHA);
STRINGISE_ENUM(D3D12_BLEND_DEST_ALPHA);
STRINGISE_ENUM(D3D12_BLEND_INV_DEST_ALPHA);
STRINGISE_ENUM(D3D12_BLEND_DEST_COLOR);
STRINGISE_ENUM(D3D12_BLEND_INV_DEST_COLOR);
STRINGISE_ENUM(D3D12_BLEND_SRC_ALPHA_SAT);
STRINGISE_ENUM(D3D12_BLEND_BLEND_FACTOR);
STRINGISE_ENUM(D3D12_BLEND_INV_BLEND_FACTOR);
STRINGISE_ENUM(D3D12_BLEND_SRC1_COLOR);
STRINGISE_ENUM(D3D12_BLEND_INV_SRC1_COLOR);
STRINGISE_ENUM(D3D12_BLEND_SRC1_ALPHA);
STRINGISE_ENUM(D3D12_BLEND_INV_SRC1_ALPHA);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_BLEND_OP &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_BLEND_OP);
{
STRINGISE_ENUM(D3D12_BLEND_OP_ADD);
STRINGISE_ENUM(D3D12_BLEND_OP_SUBTRACT);
STRINGISE_ENUM(D3D12_BLEND_OP_REV_SUBTRACT);
STRINGISE_ENUM(D3D12_BLEND_OP_MIN);
STRINGISE_ENUM(D3D12_BLEND_OP_MAX);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_LOGIC_OP &el)
{
BEGIN_ENUM_STRINGISE(D3D12_LOGIC_OP);
{
STRINGISE_ENUM(D3D12_LOGIC_OP_CLEAR);
STRINGISE_ENUM(D3D12_LOGIC_OP_SET);
STRINGISE_ENUM(D3D12_LOGIC_OP_COPY);
STRINGISE_ENUM(D3D12_LOGIC_OP_COPY_INVERTED);
STRINGISE_ENUM(D3D12_LOGIC_OP_NOOP);
STRINGISE_ENUM(D3D12_LOGIC_OP_INVERT);
STRINGISE_ENUM(D3D12_LOGIC_OP_AND);
STRINGISE_ENUM(D3D12_LOGIC_OP_NAND);
STRINGISE_ENUM(D3D12_LOGIC_OP_OR);
STRINGISE_ENUM(D3D12_LOGIC_OP_NOR);
STRINGISE_ENUM(D3D12_LOGIC_OP_XOR);
STRINGISE_ENUM(D3D12_LOGIC_OP_EQUIV);
STRINGISE_ENUM(D3D12_LOGIC_OP_AND_REVERSE);
STRINGISE_ENUM(D3D12_LOGIC_OP_AND_INVERTED);
STRINGISE_ENUM(D3D12_LOGIC_OP_OR_REVERSE);
STRINGISE_ENUM(D3D12_LOGIC_OP_OR_INVERTED);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_FILL_MODE &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_FILL_MODE);
{
STRINGISE_ENUM(D3D12_FILL_MODE_WIREFRAME);
STRINGISE_ENUM(D3D12_FILL_MODE_SOLID);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_CULL_MODE &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_CULL_MODE);
{
STRINGISE_ENUM(D3D12_CULL_MODE_NONE);
STRINGISE_ENUM(D3D12_CULL_MODE_FRONT);
STRINGISE_ENUM(D3D12_CULL_MODE_BACK);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_CONSERVATIVE_RASTERIZATION_MODE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_CONSERVATIVE_RASTERIZATION_MODE);
{
STRINGISE_ENUM(D3D12_CONSERVATIVE_RASTERIZATION_MODE_OFF)
STRINGISE_ENUM(D3D12_CONSERVATIVE_RASTERIZATION_MODE_ON)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_COMPARISON_FUNC &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_COMPARISON_FUNC);
{
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_NEVER);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_LESS);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_EQUAL);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_LESS_EQUAL);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_GREATER);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_NOT_EQUAL);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_GREATER_EQUAL);
STRINGISE_ENUM(D3D12_COMPARISON_FUNC_ALWAYS);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DEPTH_WRITE_MASK &el)
{
BEGIN_ENUM_STRINGISE(D3D12_DEPTH_WRITE_MASK);
{
STRINGISE_ENUM(D3D12_DEPTH_WRITE_MASK_ZERO)
STRINGISE_ENUM(D3D12_DEPTH_WRITE_MASK_ALL)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_STENCIL_OP &el)
{
// possible for unused fields via 0-initialisation
if((int)el == 0)
return "--";
BEGIN_ENUM_STRINGISE(D3D12_STENCIL_OP);
{
STRINGISE_ENUM(D3D12_STENCIL_OP_KEEP);
STRINGISE_ENUM(D3D12_STENCIL_OP_ZERO);
STRINGISE_ENUM(D3D12_STENCIL_OP_REPLACE);
STRINGISE_ENUM(D3D12_STENCIL_OP_INCR_SAT);
STRINGISE_ENUM(D3D12_STENCIL_OP_DECR_SAT);
STRINGISE_ENUM(D3D12_STENCIL_OP_INVERT);
STRINGISE_ENUM(D3D12_STENCIL_OP_INCR);
STRINGISE_ENUM(D3D12_STENCIL_OP_DECR);
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_INPUT_CLASSIFICATION &el)
{
BEGIN_ENUM_STRINGISE(D3D12_INPUT_CLASSIFICATION);
{
STRINGISE_ENUM(D3D12_INPUT_CLASSIFICATION_PER_VERTEX_DATA)
STRINGISE_ENUM(D3D12_INPUT_CLASSIFICATION_PER_INSTANCE_DATA)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_INDEX_BUFFER_STRIP_CUT_VALUE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_INDEX_BUFFER_STRIP_CUT_VALUE);
{
STRINGISE_ENUM(D3D12_INDEX_BUFFER_STRIP_CUT_VALUE_DISABLED)
STRINGISE_ENUM(D3D12_INDEX_BUFFER_STRIP_CUT_VALUE_0xFFFF)
STRINGISE_ENUM(D3D12_INDEX_BUFFER_STRIP_CUT_VALUE_0xFFFFFFFF)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_PRIMITIVE_TOPOLOGY_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_PRIMITIVE_TOPOLOGY_TYPE);
{
STRINGISE_ENUM(D3D12_PRIMITIVE_TOPOLOGY_TYPE_UNDEFINED)
STRINGISE_ENUM(D3D12_PRIMITIVE_TOPOLOGY_TYPE_POINT)
STRINGISE_ENUM(D3D12_PRIMITIVE_TOPOLOGY_TYPE_LINE)
STRINGISE_ENUM(D3D12_PRIMITIVE_TOPOLOGY_TYPE_TRIANGLE)
STRINGISE_ENUM(D3D12_PRIMITIVE_TOPOLOGY_TYPE_PATCH)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_INDIRECT_ARGUMENT_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_INDIRECT_ARGUMENT_TYPE);
{
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_DRAW)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_DRAW_INDEXED)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_DISPATCH)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_VERTEX_BUFFER_VIEW)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_INDEX_BUFFER_VIEW)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_CONSTANT)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_CONSTANT_BUFFER_VIEW)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_SHADER_RESOURCE_VIEW)
STRINGISE_ENUM(D3D12_INDIRECT_ARGUMENT_TYPE_UNORDERED_ACCESS_VIEW)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_COMMAND_LIST_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_COMMAND_LIST_TYPE);
{
STRINGISE_ENUM(D3D12_COMMAND_LIST_TYPE_DIRECT)
STRINGISE_ENUM(D3D12_COMMAND_LIST_TYPE_BUNDLE)
STRINGISE_ENUM(D3D12_COMMAND_LIST_TYPE_COMPUTE)
STRINGISE_ENUM(D3D12_COMMAND_LIST_TYPE_COPY)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TEXTURE_COPY_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_TEXTURE_COPY_TYPE);
{
STRINGISE_ENUM(D3D12_TEXTURE_COPY_TYPE_SUBRESOURCE_INDEX)
STRINGISE_ENUM(D3D12_TEXTURE_COPY_TYPE_PLACED_FOOTPRINT)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RESOURCE_DIMENSION &el)
{
BEGIN_ENUM_STRINGISE(D3D12_RESOURCE_DIMENSION);
{
STRINGISE_ENUM(D3D12_RESOURCE_DIMENSION_UNKNOWN)
STRINGISE_ENUM(D3D12_RESOURCE_DIMENSION_BUFFER)
STRINGISE_ENUM(D3D12_RESOURCE_DIMENSION_TEXTURE1D)
STRINGISE_ENUM(D3D12_RESOURCE_DIMENSION_TEXTURE2D)
STRINGISE_ENUM(D3D12_RESOURCE_DIMENSION_TEXTURE3D)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TEXTURE_LAYOUT &el)
{
BEGIN_ENUM_STRINGISE(D3D12_TEXTURE_LAYOUT);
{
STRINGISE_ENUM(D3D12_TEXTURE_LAYOUT_UNKNOWN)
STRINGISE_ENUM(D3D12_TEXTURE_LAYOUT_ROW_MAJOR)
STRINGISE_ENUM(D3D12_TEXTURE_LAYOUT_64KB_UNDEFINED_SWIZZLE)
STRINGISE_ENUM(D3D12_TEXTURE_LAYOUT_64KB_STANDARD_SWIZZLE)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TILED_RESOURCES_TIER &el)
{
BEGIN_ENUM_STRINGISE(D3D12_TILED_RESOURCES_TIER);
{
STRINGISE_ENUM(D3D12_TILED_RESOURCES_TIER_NOT_SUPPORTED)
STRINGISE_ENUM(D3D12_TILED_RESOURCES_TIER_1)
STRINGISE_ENUM(D3D12_TILED_RESOURCES_TIER_2)
STRINGISE_ENUM(D3D12_TILED_RESOURCES_TIER_3)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RESOLVE_MODE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_RESOLVE_MODE);
{
STRINGISE_ENUM(D3D12_RESOLVE_MODE_AVERAGE)
STRINGISE_ENUM(D3D12_RESOLVE_MODE_DECOMPRESS)
STRINGISE_ENUM(D3D12_RESOLVE_MODE_MAX)
STRINGISE_ENUM(D3D12_RESOLVE_MODE_MIN)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_WRITEBUFFERIMMEDIATE_MODE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_WRITEBUFFERIMMEDIATE_MODE);
{
STRINGISE_ENUM(D3D12_WRITEBUFFERIMMEDIATE_MODE_DEFAULT)
STRINGISE_ENUM(D3D12_WRITEBUFFERIMMEDIATE_MODE_MARKER_IN)
STRINGISE_ENUM(D3D12_WRITEBUFFERIMMEDIATE_MODE_MARKER_OUT)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RENDER_PASS_BEGINNING_ACCESS_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_RENDER_PASS_BEGINNING_ACCESS_TYPE);
{
STRINGISE_ENUM(D3D12_RENDER_PASS_BEGINNING_ACCESS_TYPE_DISCARD)
STRINGISE_ENUM(D3D12_RENDER_PASS_BEGINNING_ACCESS_TYPE_PRESERVE)
STRINGISE_ENUM(D3D12_RENDER_PASS_BEGINNING_ACCESS_TYPE_CLEAR)
STRINGISE_ENUM(D3D12_RENDER_PASS_BEGINNING_ACCESS_TYPE_NO_ACCESS)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RENDER_PASS_ENDING_ACCESS_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_RENDER_PASS_ENDING_ACCESS_TYPE);
{
STRINGISE_ENUM(D3D12_RENDER_PASS_ENDING_ACCESS_TYPE_DISCARD)
STRINGISE_ENUM(D3D12_RENDER_PASS_ENDING_ACCESS_TYPE_PRESERVE)
STRINGISE_ENUM(D3D12_RENDER_PASS_ENDING_ACCESS_TYPE_RESOLVE)
STRINGISE_ENUM(D3D12_RENDER_PASS_ENDING_ACCESS_TYPE_NO_ACCESS)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_SHADING_RATE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_SHADING_RATE);
{
STRINGISE_ENUM(D3D12_SHADING_RATE_1X1)
STRINGISE_ENUM(D3D12_SHADING_RATE_1X2)
STRINGISE_ENUM(D3D12_SHADING_RATE_2X1)
STRINGISE_ENUM(D3D12_SHADING_RATE_2X2)
STRINGISE_ENUM(D3D12_SHADING_RATE_2X4)
STRINGISE_ENUM(D3D12_SHADING_RATE_4X2)
STRINGISE_ENUM(D3D12_SHADING_RATE_4X4)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_SHADING_RATE_COMBINER &el)
{
BEGIN_ENUM_STRINGISE(D3D12_SHADING_RATE_COMBINER);
{
STRINGISE_ENUM(D3D12_SHADING_RATE_COMBINER_PASSTHROUGH)
STRINGISE_ENUM(D3D12_SHADING_RATE_COMBINER_OVERRIDE)
STRINGISE_ENUM(D3D12_SHADING_RATE_COMBINER_MIN)
STRINGISE_ENUM(D3D12_SHADING_RATE_COMBINER_MAX)
STRINGISE_ENUM(D3D12_SHADING_RATE_COMBINER_SUM)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_ROOT_PARAMETER_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_ROOT_PARAMETER_TYPE);
{
STRINGISE_ENUM(D3D12_ROOT_PARAMETER_TYPE_DESCRIPTOR_TABLE)
STRINGISE_ENUM(D3D12_ROOT_PARAMETER_TYPE_32BIT_CONSTANTS)
STRINGISE_ENUM(D3D12_ROOT_PARAMETER_TYPE_CBV)
STRINGISE_ENUM(D3D12_ROOT_PARAMETER_TYPE_SRV)
STRINGISE_ENUM(D3D12_ROOT_PARAMETER_TYPE_UAV)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_SHADER_VISIBILITY &el)
{
BEGIN_ENUM_STRINGISE(D3D12_SHADER_VISIBILITY);
{
STRINGISE_ENUM(D3D12_SHADER_VISIBILITY_ALL)
STRINGISE_ENUM(D3D12_SHADER_VISIBILITY_VERTEX)
STRINGISE_ENUM(D3D12_SHADER_VISIBILITY_HULL)
STRINGISE_ENUM(D3D12_SHADER_VISIBILITY_DOMAIN)
STRINGISE_ENUM(D3D12_SHADER_VISIBILITY_GEOMETRY)
STRINGISE_ENUM(D3D12_SHADER_VISIBILITY_PIXEL)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_STATIC_BORDER_COLOR &el)
{
BEGIN_ENUM_STRINGISE(D3D12_STATIC_BORDER_COLOR);
{
STRINGISE_ENUM(D3D12_STATIC_BORDER_COLOR_TRANSPARENT_BLACK)
STRINGISE_ENUM(D3D12_STATIC_BORDER_COLOR_OPAQUE_BLACK)
STRINGISE_ENUM(D3D12_STATIC_BORDER_COLOR_OPAQUE_WHITE)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DESCRIPTOR_RANGE_TYPE &el)
{
BEGIN_ENUM_STRINGISE(D3D12_DESCRIPTOR_RANGE_TYPE);
{
STRINGISE_ENUM(D3D12_DESCRIPTOR_RANGE_TYPE_SRV)
STRINGISE_ENUM(D3D12_DESCRIPTOR_RANGE_TYPE_UAV)
STRINGISE_ENUM(D3D12_DESCRIPTOR_RANGE_TYPE_CBV)
STRINGISE_ENUM(D3D12_DESCRIPTOR_RANGE_TYPE_SAMPLER)
}
END_ENUM_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_CLEAR_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_CLEAR_FLAGS);
{
STRINGISE_BITFIELD_BIT(D3D12_CLEAR_FLAG_DEPTH);
STRINGISE_BITFIELD_BIT(D3D12_CLEAR_FLAG_STENCIL);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_BUFFER_SRV_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_BUFFER_SRV_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_BUFFER_SRV_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_BUFFER_SRV_FLAG_RAW);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DSV_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_DSV_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_DSV_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_DSV_FLAG_READ_ONLY_DEPTH);
STRINGISE_BITFIELD_BIT(D3D12_DSV_FLAG_READ_ONLY_STENCIL);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_BUFFER_UAV_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_BUFFER_UAV_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_BUFFER_UAV_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_BUFFER_UAV_FLAG_RAW);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_HEAP_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_HEAP_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_HEAP_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_SHARED);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_DENY_BUFFERS);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_ALLOW_DISPLAY);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_SHARED_CROSS_ADAPTER);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_DENY_RT_DS_TEXTURES);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_DENY_NON_RT_DS_TEXTURES);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_HARDWARE_PROTECTED);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_ALLOW_WRITE_WATCH);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_ALLOW_SHADER_ATOMICS);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_CREATE_NOT_RESIDENT);
STRINGISE_BITFIELD_BIT(D3D12_HEAP_FLAG_CREATE_NOT_ZEROED);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_FENCE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_FENCE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_FENCE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_FENCE_FLAG_SHARED);
STRINGISE_BITFIELD_BIT(D3D12_FENCE_FLAG_SHARED_CROSS_ADAPTER);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DESCRIPTOR_HEAP_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_DESCRIPTOR_HEAP_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_DESCRIPTOR_HEAP_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_DESCRIPTOR_HEAP_FLAG_SHADER_VISIBLE);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RESOURCE_BARRIER_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_RESOURCE_BARRIER_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_RESOURCE_BARRIER_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_BARRIER_FLAG_BEGIN_ONLY);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_BARRIER_FLAG_END_ONLY);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RESOURCE_STATES &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_RESOURCE_STATES);
{
STRINGISE_BITFIELD_VALUE(D3D12_RESOURCE_STATE_COMMON);
STRINGISE_BITFIELD_VALUE(D3D12_RESOURCE_STATE_GENERIC_READ);
STRINGISE_BITFIELD_VALUE(D3D12_RESOURCE_STATE_ALL_SHADER_RESOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VERTEX_AND_CONSTANT_BUFFER);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_INDEX_BUFFER);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_RENDER_TARGET);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_UNORDERED_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_DEPTH_WRITE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_DEPTH_READ);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_NON_PIXEL_SHADER_RESOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_PIXEL_SHADER_RESOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_STREAM_OUT);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_INDIRECT_ARGUMENT);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_COPY_DEST);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_COPY_SOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_RESOLVE_DEST);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_RESOLVE_SOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_RAYTRACING_ACCELERATION_STRUCTURE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_SHADING_RATE_SOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VIDEO_DECODE_READ);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VIDEO_DECODE_WRITE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VIDEO_PROCESS_READ);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VIDEO_PROCESS_WRITE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VIDEO_ENCODE_READ);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_STATE_VIDEO_ENCODE_WRITE);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_PIPELINE_STATE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_PIPELINE_STATE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_PIPELINE_STATE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_PIPELINE_STATE_FLAG_TOOL_DEBUG);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RESOURCE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_RESOURCE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_RESOURCE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_FLAG_ALLOW_RENDER_TARGET);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_FLAG_ALLOW_DEPTH_STENCIL);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_FLAG_ALLOW_UNORDERED_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_FLAG_DENY_SHADER_RESOURCE);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_FLAG_ALLOW_CROSS_ADAPTER);
STRINGISE_BITFIELD_BIT(D3D12_RESOURCE_FLAG_ALLOW_SIMULTANEOUS_ACCESS);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_COMMAND_QUEUE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_COMMAND_QUEUE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_COMMAND_QUEUE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_COMMAND_QUEUE_FLAG_DISABLE_GPU_TIMEOUT);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TILE_COPY_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_TILE_COPY_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_TILE_COPY_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_TILE_COPY_FLAG_NO_HAZARD);
STRINGISE_BITFIELD_BIT(D3D12_TILE_COPY_FLAG_LINEAR_BUFFER_TO_SWIZZLED_TILED_RESOURCE);
STRINGISE_BITFIELD_BIT(D3D12_TILE_COPY_FLAG_SWIZZLED_TILED_RESOURCE_TO_LINEAR_BUFFER);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TILE_MAPPING_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_TILE_MAPPING_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_TILE_MAPPING_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_TILE_MAPPING_FLAG_NO_HAZARD);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_TILE_RANGE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_TILE_RANGE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_TILE_RANGE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_TILE_RANGE_FLAG_NULL);
STRINGISE_BITFIELD_BIT(D3D12_TILE_RANGE_FLAG_SKIP);
STRINGISE_BITFIELD_BIT(D3D12_TILE_RANGE_FLAG_REUSE_SINGLE_TILE);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_COLOR_WRITE_ENABLE &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_COLOR_WRITE_ENABLE);
{
STRINGISE_BITFIELD_VALUE(D3D12_COLOR_WRITE_ENABLE_ALL);
STRINGISE_BITFIELD_BIT(D3D12_COLOR_WRITE_ENABLE_RED);
STRINGISE_BITFIELD_BIT(D3D12_COLOR_WRITE_ENABLE_GREEN);
STRINGISE_BITFIELD_BIT(D3D12_COLOR_WRITE_ENABLE_BLUE);
STRINGISE_BITFIELD_BIT(D3D12_COLOR_WRITE_ENABLE_ALPHA);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_VIEW_INSTANCING_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_VIEW_INSTANCING_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_VIEW_INSTANCING_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_VIEW_INSTANCING_FLAG_ENABLE_VIEW_INSTANCE_MASKING);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_COMMAND_LIST_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_COMMAND_LIST_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_COMMAND_LIST_FLAG_NONE);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_RENDER_PASS_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_RENDER_PASS_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_RENDER_PASS_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_RENDER_PASS_FLAG_ALLOW_UAV_WRITES);
STRINGISE_BITFIELD_BIT(D3D12_RENDER_PASS_FLAG_SUSPENDING_PASS);
STRINGISE_BITFIELD_BIT(D3D12_RENDER_PASS_FLAG_RESUMING_PASS);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_ROOT_SIGNATURE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_ROOT_SIGNATURE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_ROOT_SIGNATURE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_ALLOW_INPUT_ASSEMBLER_INPUT_LAYOUT);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_DENY_VERTEX_SHADER_ROOT_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_DENY_HULL_SHADER_ROOT_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_DENY_DOMAIN_SHADER_ROOT_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_DENY_GEOMETRY_SHADER_ROOT_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_DENY_PIXEL_SHADER_ROOT_ACCESS);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_ALLOW_STREAM_OUTPUT);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_SIGNATURE_FLAG_LOCAL_ROOT_SIGNATURE);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_ROOT_DESCRIPTOR_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_ROOT_DESCRIPTOR_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_ROOT_DESCRIPTOR_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_DESCRIPTOR_FLAG_DATA_VOLATILE);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_DESCRIPTOR_FLAG_DATA_STATIC_WHILE_SET_AT_EXECUTE);
STRINGISE_BITFIELD_BIT(D3D12_ROOT_DESCRIPTOR_FLAG_DATA_STATIC);
}
END_BITFIELD_STRINGISE();
}
template <>
rdcstr DoStringise(const D3D12_DESCRIPTOR_RANGE_FLAGS &el)
{
BEGIN_BITFIELD_STRINGISE(D3D12_DESCRIPTOR_RANGE_FLAGS);
{
STRINGISE_BITFIELD_VALUE(D3D12_DESCRIPTOR_RANGE_FLAG_NONE);
STRINGISE_BITFIELD_BIT(D3D12_DESCRIPTOR_RANGE_FLAG_DESCRIPTORS_VOLATILE);
STRINGISE_BITFIELD_BIT(D3D12_DESCRIPTOR_RANGE_FLAG_DATA_VOLATILE);
STRINGISE_BITFIELD_BIT(D3D12_DESCRIPTOR_RANGE_FLAG_DATA_STATIC_WHILE_SET_AT_EXECUTE);
STRINGISE_BITFIELD_BIT(D3D12_DESCRIPTOR_RANGE_FLAG_DATA_STATIC);
STRINGISE_BITFIELD_BIT(
D3D12_DESCRIPTOR_RANGE_FLAG_DESCRIPTORS_STATIC_KEEPING_BUFFER_BOUNDS_CHECKS);
}
END_BITFIELD_STRINGISE();
}
| [
"[email protected]"
] | |
abf3b128710657840c24495304b977e7a476d28a | bedc7ba29919fe77b96338096a33c548cc4a3f44 | /histogram.h | b07e6be546ec7ee27d6bb35ca5552d43615cfca8 | [] | no_license | MavrinaAA/cs_laba03 | 4f9fa5dded123b13dfda8f60e5e4b2a3d5071c8c | 508a4db751fc1c8c23d1535764a1281b97ddcfb7 | refs/heads/main | 2023-05-14T00:37:45.800633 | 2021-05-19T16:13:16 | 2021-05-19T16:13:16 | 361,726,563 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 287 | h | #pragma once
#include <vector>
#include <iostream>
using namespace std;
void
find_minmax(const vector<double>& numbers, double& min, double& max);
vector<size_t>
make_histogram (const vector<double>& numbers,size_t bin_count);
void
show_histogram_text (const vector<size_t>& bins);
| [
"[email protected]"
] | |
e86e27dc8a89248c0be024d02651d70af14a07c6 | 4369050c1694b57db3c6f4417a0824978af97062 | /src/SDL2/Entities/Texture.cpp | f6869b1078e0226a3f7ce41e1f05e73d691377b5 | [] | no_license | Serdok/GoldenPhoenix | 18c6c87440bab6cd94f0a2ba79173150630d2c30 | 927519c80038f452f626a9e4d19c64fa95156772 | refs/heads/master | 2021-05-20T23:09:12.889371 | 2019-05-06T17:26:12 | 2019-05-06T17:26:12 | 252,445,809 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,851 | cpp | //
// Created by serdok on 09/03/19.
//
#include "Texture.h"
Texture::Texture( const std::string& imagefile, bool fullscreen )
: _fullscreen( fullscreen )
{
// Load the image
_texture = AssetsManager::GetInstance()->GetTexture( imagefile );
// Fetch image size
SDL_QueryTexture( _texture, nullptr, nullptr, &_width, &_height );
_dest.w = _width;
_dest.h = _height;
}
Texture::Texture( const std::string& imagefile, int x, int y, int width, int height, bool fullscreen )
: _clipped( true ), _fullscreen( fullscreen )
{
// Load the image
_texture = AssetsManager::GetInstance()->GetTexture( imagefile );
// Set image sizes
_dest.w = _width = width;
_dest.h = _height = height;
// Set clip size
_clip = { x, y, width, height };
}
Texture::Texture( const std::string& text, const std::string& font, int size, const SDL_Color& color, bool fullscreen )
: _fullscreen( fullscreen )
{
// Convert message to texture
_texture = AssetsManager::GetInstance()->GetMessage( text, font, size, color );
// Fetch texture size
SDL_QueryTexture( _texture, nullptr, nullptr, &_width, &_height );
_dest.w = _width;
_dest.h = _height;
}
Texture::~Texture()
{
_texture = nullptr;
}
int Texture::GetWidth() const
{
return _width;
}
int Texture::GetHeight() const
{
return _height;
}
void Texture::SetAlpha( unsigned char alpha )
{
SDL_SetTextureAlphaMod( _texture, alpha );
}
void Texture::SetBlendingMode( SDL_BlendMode mode )
{
SDL_SetTextureBlendMode( _texture, mode );
}
void Texture::Update()
{
// Overridden in derived classes
}
void Texture::Render()
{
// Calculate destination coordinates. Image will be rendered from its center point
Vector2f position = GetPosition();
Vector2f scale = GetScale();
_dest.x = (int) ( position.x - _width*scale.x*0.5f );
_dest.y = (int) ( position.y - _height*scale.y*0.5f );
_dest.w = (int) ( _width*scale.x );
_dest.h = (int) ( _height*scale.y );
// Load texture in renderer
Graphics::GetInstance()->DrawTexture( _texture, ( _clipped ? &_clip : nullptr ), ( _fullscreen ? nullptr : &_dest ),
GetRotation() );
}
void Texture::Render( SDL_RendererFlip flip )
{
// Calculate destination coordinates. Image will be rendered from its center point
Vector2f position = GetPosition();
Vector2f scale = GetScale();
_dest.x = (int) ( position.x - _width*scale.x*0.5f );
_dest.y = (int) ( position.y - _height*scale.y*0.5f );
_dest.w = (int) ( _width*scale.x );
_dest.h = (int) ( _height*scale.y );
// Load texture in renderer
Graphics::GetInstance()->DrawTexture( _texture, ( _clipped ? &_clip : nullptr ), ( _fullscreen ? nullptr : &_dest ),
GetRotation(), flip );
} | [
"[email protected]"
] | |
efe64c5ff649cb127b8e5b35facfcfc51f046d5e | 5ea5dc570b6d6bd243abd948d83021bf00cfd066 | /VRENAR Object Classes/Eye Tracking.h | d4a20a0511bbacefd76614adbfb6ebfa055265a7 | [
"Apache-2.0"
] | permissive | REMMI-Research/VRENAR-auto | 3b1548aaa85df4081d9b2c91e652e5b65853ab56 | 8462798407bb67d9a7463df879da9da35475e8c1 | refs/heads/master | 2020-04-07T18:23:40.400898 | 2018-11-21T21:33:50 | 2018-11-21T21:33:50 | 158,608,191 | 0 | 0 | Apache-2.0 | 2018-11-21T21:33:51 | 2018-11-21T21:28:07 | null | UTF-8 | C++ | false | false | 603 | h | ///////////////////////////////////////////////////////////
// Eye Tracking.h
// Implementation of the Class Eye Tracking
// Created on: 21-Nov-2018 21:19:48
// Original author: Magneto
///////////////////////////////////////////////////////////
#if !defined(EA_1DDAAAFF_99B0_4f34_AADC_A1AC84B7EDC0__INCLUDED_)
#define EA_1DDAAAFF_99B0_4f34_AADC_A1AC84B7EDC0__INCLUDED_
#include "Machine Vision.h"
class Eye Tracking : public Machine Vision
{
public:
Eye Tracking();
virtual ~Eye Tracking();
};
#endif // !defined(EA_1DDAAAFF_99B0_4f34_AADC_A1AC84B7EDC0__INCLUDED_)
| [
"[email protected]"
] | |
717225bc6ea0788e5edf5b5496536221e1f40c44 | cf2b77f1e27736862d349509dee8374c787b050d | /sloeber.ino.cpp | 8b2609ab016d60a275f37d5ec63661a217e5c93d | [] | no_license | eziya/ESP8266_GxEPD_TEST | 55e9fa18fa0be1557e61e8f21e71956d5a1d51d5 | 6b7b168af456ffc62ae30b9313c8556ff76024a7 | refs/heads/master | 2020-03-31T17:29:58.782077 | 2018-10-22T13:17:18 | 2018-10-22T13:17:18 | 152,425,327 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 930 | cpp | #ifdef __IN_ECLIPSE__
//This is a automatic generated file
//Please do not modify this file
//If you touch this file your change will be overwritten during the next build
//This file has been generated on 2018-10-11 20:14:33
#include "Arduino.h"
#include "Arduino.h"
#include <GxEPD.h>
#include <GxGDEP015OC1/GxGDEP015OC1.h>
#include <GxIO/GxIO_SPI/GxIO_SPI.h>
#include <GxIO/GxIO.h>
#include <Fonts/DSDIGIT9pt7b.h>
#include <Fonts/DSDIGIT12pt7b.h>
#include <Fonts/DSDIGIT18pt7b.h>
#include <Fonts/DSDIGIT24pt7b.h>
#include <Fonts/DSDIGIT30pt7b.h>
#include <GxGDEP015OC1/BitmapExamples.h>
#include "ImageData.h"
void setup() ;
void loop() ;
void showBitmapExample() ;
void showBoat() ;
void showFont(const char name[], const GFXfont* font) ;
void drawCornerTest() ;
void showBlackBoxCallback(uint32_t v) ;
void showValueBoxCallback(const uint32_t v) ;
void showPartialUpdatePaged() ;
#include "ESP8266_GxEPD_TEST.ino"
#endif
| [
"[email protected]"
] | |
023ee51ece6a36f5a6e84b6d5b8e17f0d25e88d7 | f9ff7e219c50aa6961846bde39deb0418f58fb8f | /usami-ray/include/usami/ray/bsdf/bsdf_geometry.h | e360d1d6318022ba279afd572238b5214951ebdd | [] | no_license | daiyousei-qz/Usami | a46073b86fc02d04756678992d1c6748d12e3e67 | dfdbb463818302462a881c9cc077c258716f3027 | refs/heads/master | 2023-03-15T07:27:44.678096 | 2021-03-10T20:58:28 | 2021-03-10T20:58:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,018 | h | #pragma once
#include "usami/math/math.h"
namespace usami::ray
{
// calculation of Bsdf instance would be done in local coordinate
// where scattering normal vector is mapped to kBsdfNormal
constexpr Vec3f kBsdfNormal = Vec3f{0.f, 0.f, 1.f};
// create transform from **world coordinate** to **bsdf local coordinate**
// TODO: this transform only support non-polarized bsdf
// TODO: generate inverse matrix, too
inline Matrix4 CreateBsdfCoordTransform(Vec3f n)
{
if (n.x != 0 || n.y != 0)
{
Vec3f nz = n.Normalize();
Vec3f nx = Vec3f{n.y, -n.x, 0.f}.Normalize();
Vec3f ny = Cross(n, nx);
return Matrix4::ChangeBasis3D(nx, ny, nz, 0.f);
}
else
{
Vec3f nz = n.Normalize();
Vec3f nx = Vec3f{n.z > 0 ? 1.f : -1.f, 0.f, 0.f};
Vec3f ny = Vec3f{0.f, 1.f, 0.f};
return Matrix4::ChangeBasis3D(nx, ny, nz, 0.f);
}
}
inline bool SameHemisphere(const Vec3f& wo, const Vec3f& wi) noexcept
{
return wo.z * wi.z > 0;
}
inline float CosTheta(const Vec3f& w) noexcept
{
return w.z;
}
inline float Cos2Theta(const Vec3f& w) noexcept
{
return w.z * w.z;
}
inline float AbsCosTheta(const Vec3f& w) noexcept
{
return Abs(w.z);
}
inline float Sin2Theta(const Vec3f& w) noexcept
{
return Max(0.f, 1.f - Cos2Theta(w));
}
inline float SinTheta(const Vec3f& w) noexcept
{
return Sqrt(Sin2Theta(w));
}
inline float TanTheta(const Vec3f& w) noexcept
{
return SinTheta(w) / CosTheta(w);
}
inline float Tan2Theta(const Vec3f& w) noexcept
{
return Sin2Theta(w) / Cos2Theta(w);
}
// assume SameHemiSphere(wo, n)
inline Vec3f ReflectRay(const Vec3f& wo, const Vec3f& n) noexcept
{
auto h = Dot(wo, n);
return -wo + 2 * h * n;
}
// assume n = +-kBsdfNormal
inline Vec3f ReflectRayQuick(const Vec3f& wo) noexcept
{
return Vec3f{-wo.x, -wo.y, wo.z};
}
// assume SameHemiSphere(wo, n)
// eta = etaI / etaT, i.e. inverse of refractive index
inline bool RefractRay(const Vec3f& wo, const Vec3f& n, float eta, Vec3f& refracted) noexcept
{
float cosThetaI = Dot(n, wo);
float sin2ThetaI = Max(0.f, 1.f - cosThetaI * cosThetaI);
float sin2ThetaT = eta * eta * sin2ThetaI;
if (sin2ThetaT > 1)
{
return false;
}
float cosThetaT = Sqrt(1.f - sin2ThetaT);
refracted = -eta * wo + (eta * cosThetaI - cosThetaT) * n;
return true;
}
// eta = etaI / etaT
inline constexpr float Schlick(float cos_theta, float eta) noexcept
{
auto r0 = (eta - 1) / (eta + 1);
r0 = r0 * r0;
auto root = 1 - cos_theta;
auto root2 = root * root;
return r0 + (1 - r0) * root2 * root;
}
} // namespace usami::ray
| [
"[email protected]"
] | |
ce64adb1d02aabc44817038c17d655e5a16ee42d | 250dd2597d72cf7b7c109909ea5b33b151e42af2 | /src/stdio/zstdio.h | 7805f6f7ea1d723de24598fb0db5a032324153a5 | [] | no_license | goddanao/php-czmq-legacy | 83d5ab582ebc69df891e4d77a99c2fc460efa3b6 | 3ae0a16008462f868007f7cb9c1f8145110f154a | refs/heads/master | 2021-01-22T15:49:59.766391 | 2016-03-16T12:17:45 | 2016-03-16T12:17:45 | 29,911,347 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,808 | h | #pragma once
#include "../common.h"
class ZStdIn : public ZHandle, public Php::Base {
public:
ZStdIn() : ZHandle(STDIN_FILENO, false, "fd"), Php::Base() { }
Php::Value recv(Php::Parameters ¶m){
Php::Value result;
result.reserve(4096);
int num_read = read(get_fd(), (void *) result.rawValue(), 4096);
result.reserve(num_read);
return result;
}
Php::Value send(Php::Parameters ¶m) {
const char *pointer = param[0].rawValue();
return (write(get_fd(), pointer, param[0].size()) == param[0].size());
}
static Php::Class<ZStdIn> php_register() {
Php::Class<ZStdIn> o("ZStdIn");
o.method("recv", &ZStdIn::recv);
o.method("send", &ZStdIn::send, {
Php::ByVal("data", Php::Type::String, true)
});
// IZDescriptor intf support
ZHandle::register_izdescriptor((Php::Class<ZStdIn> *) &o);
return o;
}
};
class ZStdOut : public ZHandle, public Php::Base {
public:
ZStdOut() : ZHandle(STDOUT_FILENO, false, "fd"), Php::Base() { }
Php::Value recv(Php::Parameters ¶m){
Php::Value result;
result.reserve(4096);
int num_read = read(get_fd(), (void *) result.rawValue(), 4096);
result.reserve(num_read);
return result;
}
Php::Value send(Php::Parameters ¶m) {
const char *pointer = param[0].rawValue();
return (write(get_fd(), pointer, param[0].size()) == param[0].size());
}
static Php::Class<ZStdOut> php_register() {
Php::Class<ZStdOut> o("ZStdOut");
o.method("recv", &ZStdOut::recv);
o.method("send", &ZStdOut::send, {
Php::ByVal("data", Php::Type::String, true)
});
// IZDescriptor intf support
ZHandle::register_izdescriptor((Php::Class<ZStdOut> *) &o);
return o;
}
};
class ZStdErr : public ZHandle, public Php::Base {
public:
ZStdErr() : ZHandle(STDERR_FILENO, false, "fd"), Php::Base() { }
Php::Value recv(Php::Parameters ¶m){
Php::Value result;
result.reserve(4096);
int num_read = read(get_fd(), (void *) result.rawValue(), 4096);
result.reserve(num_read);
return result;
}
Php::Value send(Php::Parameters ¶m) {
const char *pointer = param[0].rawValue();
return (write(get_fd(), pointer, param[0].size()) == param[0].size());
}
static Php::Class<ZStdErr> php_register() {
Php::Class<ZStdErr> o("ZStdErr");
o.method("recv", &ZStdErr::recv);
o.method("send", &ZStdErr::send, {
Php::ByVal("data", Php::Type::String, true)
});
// IZDescriptor intf support
ZHandle::register_izdescriptor((Php::Class<ZStdErr> *) &o);
return o;
}
}; | [
"[email protected]"
] | |
c6cdc7a9e9d4a08e960cdf8b02fa3c139f7d5ef2 | 4ac1e916a5c376d687ad868b218bd95074f5fa12 | /r7q2/src/MinhaEmpresa.cpp | 5e849e783fb6dfdf5d5f31a3a0c15ee99e0f3f78 | [] | no_license | henriqueeraraujo/roteiro7 | 87abba2243590190c1dfdf825e318f99bedd261c | ab9ee4fe9896ae98756eb7ebbb3efea645c64229 | refs/heads/master | 2021-07-13T17:52:52.170028 | 2017-10-19T12:48:15 | 2017-10-19T12:48:15 | 104,886,962 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 723 | cpp | #include "MinhaEmpresa.h"
MinhaEmpresa::MinhaEmpresa(){
f1=Funcionario();
c1=Consultor();
}
void MinhaEmpresa::menu(){
cout<<"\n**********\tMENU\t**********\n";
cout<<"0 - Sair\n";
cout<<"1 - Mostrar dados do Funcionario\n";
cout<<"2 - Alterar nome do Funcionario\n";
cout<<"3 - Alterar matricula do funcionario\n";
cout<<"4 - alterar salario do funcionario\n";
cout<<"5 - Mostrar dados do Consultor\n";
cout<<"6 - Alterar nome do Consultor\n";
cout<<"7 - Alterar matricula do Consultor\n";
cout<<"8 - alterar salario do Consultor\n";
cout<<"9 - alterar percentual de aumento de salario do consultor\n";
cout<<"--> ";
}
MinhaEmpresa::~MinhaEmpresa()
{
//dtor
}
| [
"[email protected]"
] | |
840cdcad7e681deec3db18499902777bc8bd2c3f | d9c4b7e621e8016203008fc31e6d0d7bffaf7279 | /Node.h | 7e25b4eb7b868051931bc4501be4c51b11f2b944 | [] | no_license | FranciscoGJ/ABBTreap | c6965dfc4332f1309fd022a60d973c4145c55132 | f0117d9246555bb8de1c86adc2f45ed5bdf41427 | refs/heads/master | 2021-07-12T22:01:32.673302 | 2015-06-11T01:21:49 | 2015-06-11T01:21:49 | 107,433,935 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 544 | h | //
// Created by Francisco on 27-05-2015.
//
#ifndef TAREA2ESTRUCTURA_NODE_H
#define TAREA2ESTRUCTURA_NODE_H
#include <iostream>
using namespace std;
template <typename k, typename v>
class Node{
public:
k key;
v value;
int priority;
Node<k,v>* m_right;
Node<k,v>* m_left;
Node(k key, v value, int priority) : key(key), value(value), priority(priority), m_right(nullptr),
m_left(nullptr) { }
virtual ~Node() { }
};
#endif //TAREA2ESTRUCTURA_NODE_H
| [
"[email protected]"
] | |
ae455cb1e165ab0e17c5639542f038a425767bbd | 7efc72aa1cf4667f759a7a89d015143b5f8456e9 | /src/learn/01/camera_class.cpp | 6e9e29e9b76afc5fdfbc12d32c38b9c15f2eea6e | [] | no_license | ORZaaa/openGL | ebe88120ec4c4a04e491dd4197bcc59055f80d9a | d8bd29f8d8cf3b943c48903a3ee0c2e0536e4583 | refs/heads/master | 2020-05-20T07:12:07.090639 | 2019-05-07T17:03:13 | 2019-05-07T17:03:13 | 185,444,031 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,946 | cpp | ///**
//*┌──────────────────────────────────────────────────────────────┐
//*│ Info:
//*│ Author: Carl
//*│ Version: 1.0
//*│ Creat Time: 19.04.21
//*└──────────────────────────────────────────────────────────────┘
//*/
//
//#include <glad/glad.h>
//#include <GLFW/glfw3.h>
//#define STB_IMAGE_IMPLEMENTATION
//#include <stb_image.h>
//
//#include <glm/glm.hpp>
//#include <glm/gtc/matrix_transform.hpp>
//#include <glm/gtc/type_ptr.hpp>
//
//#include <shader_m.h>
//#include <camera.h>
//
//#include <iostream>
//
//void framebuffer_size_callback(GLFWwindow* window, int width, int height);
//void mouse_callback(GLFWwindow* window, double xpos, double ypos);
//void scroll_callback(GLFWwindow* window, double xoffset, double yoffset);
//void processInput(GLFWwindow *window);
//
//// settings
//const unsigned int SCR_WIDTH = 800;
//const unsigned int SCR_HEIGHT = 600;
//
//// camera
//Camera camera(glm::vec3(0.0f, 0.0f, 3.0f));
//float lastX = SCR_WIDTH / 2.0f;
//float lastY = SCR_HEIGHT / 2.0f;
//bool firstMouse = true;
//
//// timing
//float deltaTime = 0.0f; // time between current frame and last frame
//float lastFrame = 0.0f;
//
//int main()
//{
// /**
// * init GLFW window
// */
// glfwInit();
//
// // Choose openGL Version
// glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
// glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);
//
// // Choose openGL Model: core
// glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);
//
//#ifdef __APPLE__
// glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE); // uncomment this statement to fix compilation on OS X
//#endif
//
// /**
// * create window
// */
// GLFWwindow* window = glfwCreateWindow(SCR_WIDTH, SCR_HEIGHT, "LearnOpenGL", NULL, NULL);
// if (window == NULL)
// {
// std::cout << "Failed to create GLFW window" << std::endl;
// glfwTerminate();
// return -1;
// }
// glfwMakeContextCurrent(window);
// glfwSetFramebufferSizeCallback(window, framebuffer_size_callback);
// glfwSetCursorPosCallback(window, mouse_callback);
// glfwSetScrollCallback(window, scroll_callback);
//
// // tell GLFW to capture our mouse
// glfwSetInputMode(window, GLFW_CURSOR, GLFW_CURSOR_DISABLED);
//
// /**
// * init GLAD
// */
// if (!gladLoadGLLoader((GLADloadproc)glfwGetProcAddress))
// {
// std::cout << "Failed to initialize GLAD" << std::endl;
// return -1;
// }
//
// //------------------------------------------------
// /**
// * Enable GL_DEPTH_TEST
// */
// glEnable(GL_DEPTH_TEST);
//
//
// //-----------------------------------------------------------
// /**
// * build shader
// */
// Shader ourShader("shaders/learn/1.getting_started/7.4.camera.vs", "shaders/learn/1.getting_started/7.4.camera.fs");
//
//
// //---------------------------------------------
// /**
// * Vertex data
// */
// float vertices[] = {
// -0.5f, -0.5f, -0.5f, 0.0f, 0.0f,
// 0.5f, -0.5f, -0.5f, 1.0f, 0.0f,
// 0.5f, 0.5f, -0.5f, 1.0f, 1.0f,
// 0.5f, 0.5f, -0.5f, 1.0f, 1.0f,
// -0.5f, 0.5f, -0.5f, 0.0f, 1.0f,
// -0.5f, -0.5f, -0.5f, 0.0f, 0.0f,
//
// -0.5f, -0.5f, 0.5f, 0.0f, 0.0f,
// 0.5f, -0.5f, 0.5f, 1.0f, 0.0f,
// 0.5f, 0.5f, 0.5f, 1.0f, 1.0f,
// 0.5f, 0.5f, 0.5f, 1.0f, 1.0f,
// -0.5f, 0.5f, 0.5f, 0.0f, 1.0f,
// -0.5f, -0.5f, 0.5f, 0.0f, 0.0f,
//
// -0.5f, 0.5f, 0.5f, 1.0f, 0.0f,
// -0.5f, 0.5f, -0.5f, 1.0f, 1.0f,
// -0.5f, -0.5f, -0.5f, 0.0f, 1.0f,
// -0.5f, -0.5f, -0.5f, 0.0f, 1.0f,
// -0.5f, -0.5f, 0.5f, 0.0f, 0.0f,
// -0.5f, 0.5f, 0.5f, 1.0f, 0.0f,
//
// 0.5f, 0.5f, 0.5f, 1.0f, 0.0f,
// 0.5f, 0.5f, -0.5f, 1.0f, 1.0f,
// 0.5f, -0.5f, -0.5f, 0.0f, 1.0f,
// 0.5f, -0.5f, -0.5f, 0.0f, 1.0f,
// 0.5f, -0.5f, 0.5f, 0.0f, 0.0f,
// 0.5f, 0.5f, 0.5f, 1.0f, 0.0f,
//
// -0.5f, -0.5f, -0.5f, 0.0f, 1.0f,
// 0.5f, -0.5f, -0.5f, 1.0f, 1.0f,
// 0.5f, -0.5f, 0.5f, 1.0f, 0.0f,
// 0.5f, -0.5f, 0.5f, 1.0f, 0.0f,
// -0.5f, -0.5f, 0.5f, 0.0f, 0.0f,
// -0.5f, -0.5f, -0.5f, 0.0f, 1.0f,
//
// -0.5f, 0.5f, -0.5f, 0.0f, 1.0f,
// 0.5f, 0.5f, -0.5f, 1.0f, 1.0f,
// 0.5f, 0.5f, 0.5f, 1.0f, 0.0f,
// 0.5f, 0.5f, 0.5f, 1.0f, 0.0f,
// -0.5f, 0.5f, 0.5f, 0.0f, 0.0f,
// -0.5f, 0.5f, -0.5f, 0.0f, 1.0f
// };
// // world space positions of our cubes
// glm::vec3 cubePositions[] = {
// glm::vec3(0.0f, 0.0f, 0.0f),
// glm::vec3(2.0f, 5.0f, -15.0f),
// glm::vec3(-1.5f, -2.2f, -2.5f),
// glm::vec3(-3.8f, -2.0f, -12.3f),
// glm::vec3(2.4f, -0.4f, -3.5f),
// glm::vec3(-1.7f, 3.0f, -7.5f),
// glm::vec3(1.3f, -2.0f, -2.5f),
// glm::vec3(1.5f, 2.0f, -2.5f),
// glm::vec3(1.5f, 0.2f, -1.5f),
// glm::vec3(-1.3f, 1.0f, -1.5f)
// };
// unsigned int VBO, VAO;
// glGenVertexArrays(1, &VAO);
// glGenBuffers(1, &VBO);
//
// glBindVertexArray(VAO);
//
// glBindBuffer(GL_ARRAY_BUFFER, VBO);
// glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW);
//
// // position attribute
// glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 5 * sizeof(float), (void*)0);
// glEnableVertexAttribArray(0);
// // texture coord attribute
// glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 5 * sizeof(float), (void*)(3 * sizeof(float)));
// glEnableVertexAttribArray(1);
//
//
// //--------------------------------
// /**
// * load and create a texture
// */
// unsigned int texture1, texture2;
// // texture 1
// // ---------
// glGenTextures(1, &texture1);
// glBindTexture(GL_TEXTURE_2D, texture1);
// // set the texture wrapping parameters
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);
// // set texture filtering parameters
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
// // load image, create texture and generate mipmaps
// int width, height, nrChannels;
// stbi_set_flip_vertically_on_load(true); // tell stb_image.h to flip loaded texture's on the y-axis.
// unsigned char *data = stbi_load("resources/learn/textures/container.jpg", &width, &height, &nrChannels, 0);
// if (data)
// {
// glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, width, height, 0, GL_RGB, GL_UNSIGNED_BYTE, data);
// glGenerateMipmap(GL_TEXTURE_2D);
// }
// else
// {
// std::cout << "Failed to load texture" << std::endl;
// }
// stbi_image_free(data);
// // texture 2
// // ---------
// glGenTextures(1, &texture2);
// glBindTexture(GL_TEXTURE_2D, texture2);
// // set the texture wrapping parameters
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);
// // set texture filtering parameters
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
// glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
// // load image, create texture and generate mipmaps
// data = stbi_load("resources/learn/textures/awesomeface.png", &width, &height, &nrChannels, 0);
// if (data)
// {
// // note that the awesomeface.png has transparency and thus an alpha channel, so make sure to tell OpenGL the data type is of GL_RGBA
// glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, width, height, 0, GL_RGBA, GL_UNSIGNED_BYTE, data);
// glGenerateMipmap(GL_TEXTURE_2D);
// }
// else
// {
// std::cout << "Failed to load texture" << std::endl;
// }
// stbi_image_free(data);
//
// // tell opengl for each sampler to which texture unit it belongs to (only has to be done once)
// // -------------------------------------------------------------------------------------------
// ourShader.use();
// ourShader.setInt("texture1", 0);
// ourShader.setInt("texture2", 1);
//
//
// //-------------------------------------
// /**
// * render loop
// */
// while (!glfwWindowShouldClose(window))
// {
// // per-frame time logic
// // --------------------
// float currentFrame = glfwGetTime();
// deltaTime = currentFrame - lastFrame;
// lastFrame = currentFrame;
//
// // input
// // -----
// processInput(window);
//
// // render
// // ------
// glClearColor(0.2f, 0.3f, 0.3f, 1.0f);
// glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
//
// // bind textures on corresponding texture units
// glActiveTexture(GL_TEXTURE0);
// glBindTexture(GL_TEXTURE_2D, texture1);
// glActiveTexture(GL_TEXTURE1);
// glBindTexture(GL_TEXTURE_2D, texture2);
//
// // activate shader
// ourShader.use();
//
// // pass projection matrix to shader (note that in this case it could change every frame)
// glm::mat4 projection = glm::perspective(glm::radians(camera.Zoom), (float)SCR_WIDTH / (float)SCR_HEIGHT, 0.1f, 100.0f);
// ourShader.setMat4("projection", projection);
//
// // camera/view transformation
// glm::mat4 view = camera.GetViewMatrix();
// ourShader.setMat4("view", view);
//
// // render boxes
// glBindVertexArray(VAO);
// for (unsigned int i = 0; i < 10; i++)
// {
// // calculate the model matrix for each object and pass it to shader before drawing
// glm::mat4 model = glm::mat4(1.0f); // make sure to initialize matrix to identity matrix first
// model = glm::translate(model, cubePositions[i]);
// float angle = 20.0f * i;
// model = glm::rotate(model, glm::radians(angle), glm::vec3(1.0f, 0.3f, 0.5f));
// ourShader.setMat4("model", model);
//
// glDrawArrays(GL_TRIANGLES, 0, 36);
// }
//
// // glfw: swap buffers and poll IO events (keys pressed/released, mouse moved etc.)
// // -------------------------------------------------------------------------------
// glfwSwapBuffers(window);
// glfwPollEvents();
// }
//
// // optional: de-allocate all resources once they've outlived their purpose:
// // ------------------------------------------------------------------------
// glDeleteVertexArrays(1, &VAO);
// glDeleteBuffers(1, &VBO);
//
// // glfw: terminate, clearing all previously allocated GLFW resources.
// // ------------------------------------------------------------------
// glfwTerminate();
// return 0;
//}
//
///**
// * process all input: query GLFW whether relevant keys are pressed/released this frame and react accordingly
// */
//void processInput(GLFWwindow *window)
//{
// if (glfwGetKey(window, GLFW_KEY_ESCAPE) == GLFW_PRESS)
// glfwSetWindowShouldClose(window, true);
//
// if (glfwGetKey(window, GLFW_KEY_W) == GLFW_PRESS)
// camera.ProcessKeyboard(FORWARD, deltaTime);
// if (glfwGetKey(window, GLFW_KEY_S) == GLFW_PRESS)
// camera.ProcessKeyboard(BACKWARD, deltaTime);
// if (glfwGetKey(window, GLFW_KEY_A) == GLFW_PRESS)
// camera.ProcessKeyboard(LEFT, deltaTime);
// if (glfwGetKey(window, GLFW_KEY_D) == GLFW_PRESS)
// camera.ProcessKeyboard(RIGHT, deltaTime);
//}
//
///**
// * process all input: query GLFW whether relevant keys are pressed/released this frame and react accordingly
// */
//void framebuffer_size_callback(GLFWwindow* window, int width, int height)
//{
// // make sure the viewport matches the new window dimensions; note that width and
// // height will be significantly larger than specified on retina displays.
// glViewport(0, 0, width, height);
//}
//
//
///**
// * glfw: whenever the mouse moves, this callback is called
// */
//void mouse_callback(GLFWwindow* window, double xpos, double ypos)
//{
// if (firstMouse)
// {
// lastX = xpos;
// lastY = ypos;
// firstMouse = false;
// }
//
// float xoffset = xpos - lastX;
// float yoffset = lastY - ypos; // reversed since y-coordinates go from bottom to top
//
// lastX = xpos;
// lastY = ypos;
//
// camera.ProcessMouseMovement(xoffset, yoffset);
//}
//
///**
// * glfw: whenever the mouse scroll wheel scrolls, this callback is called
// */
//void scroll_callback(GLFWwindow* window, double xoffset, double yoffset)
//{
// camera.ProcessMouseScroll(yoffset);
//}
| [
"[email protected]"
] | |
f1a81e9fbf3ade6db8db2a1f89f0d9230ff01978 | e92a0b984f0798ef2bba9ad4199b431b4f5eb946 | /2009/simulateur/src/pc/usb.cpp | ab8de296ac8a15d4d13f1712525ad3a4de6990ea | [] | no_license | AdamdbUT/mac-gyver | c09c1892080bf77c25cb4ca2a7ebaf7be3459032 | 32de5c0989710ccd671d46e0babb602e51bf8ff9 | refs/heads/master | 2021-01-23T15:53:19.383860 | 2010-06-21T13:33:38 | 2010-06-21T13:33:38 | 42,737,082 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 110 | cpp | #include "../common/simul.h"
#ifdef SIMULATION
#include "usb_simul.cpp"
#else
#include "usb_real.cpp"
#endif
| [
"[email protected]"
] | |
fd183dbde4c9711dbcbf6597ec48defd28371bea | 1393b088958301a6c2f6766df2864c61365e9d4b | /Code/Algorithms/L2/CloudMasking/vnsShadowVariationThresholdImageFilter.h | 64ef3c3db3bcb5b0e0beb50a7e64527fad9d7e11 | [
"Apache-2.0"
] | permissive | alexgoussev/maja_gitlab | f6727468cb70e210d3c09453de22fee58ed9d656 | 9688780f8dd8244e60603e1f11385e1fadc90cb4 | refs/heads/develop | 2023-02-24T05:37:38.769452 | 2021-01-21T16:47:54 | 2021-01-21T16:47:54 | 332,269,078 | 0 | 0 | Apache-2.0 | 2021-01-23T18:17:25 | 2021-01-23T17:33:18 | C++ | UTF-8 | C++ | false | false | 10,093 | h | /*
* Copyright (C) 2020 Centre National d'Etudes Spatiales (CNES)
*
* 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.
*
*/
/************************************************************************************************************
* *
* ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo *
* o *
* o *
* o *
* o *
* o ooooooo ooooooo o o oo *
* o o o o o o o o o o *
* o o o o o o o o o o *
* o o o o o o o o o o *
* o o o oooo o o o o o o *
* o o o o o o o o o *
* o o o o o o o o o o *
* oo oooooooo o o o oooooo o oooo *
* o *
* o *
* o o *
* o o oooo o o oooo *
* o o o o o o *
* o o ooo o o ooo *
* o o o o o *
* ooooo oooo o ooooo oooo *
* o *
* *
************************************************************************************************************
* *
* Author: CS Systemes d'Information (France) *
* *
************************************************************************************************************
* HISTORIQUE *
* *
* VERSION : 5-1-0 : FA : LAIG-FA-MAC-145739-CS : 27 juin 2016 : Audit code - Supp de la macro ITK_EXPORT *
* VERSION : 5-0-0 : FA : LAIG-FA-MAC-143764-CS : 12 avril 2016 : Mise en forme du code (indentation, etc.) *
* VERSION : 1-0-0-3 : DM : 357 : 31 août. 2011 : pas de correlation avec la date courante *
* VERSION : 1-0-0 : <TypeFT> : <NumFT> : 7 juin 2010 : Creation
* *
* FIN-HISTORIQUE *
* *
* $Id$
* *
************************************************************************************************************/
#ifndef __vnsShadowVariationThresholdImageFilter_h
#define __vnsShadowVariationThresholdImageFilter_h
#include "itkImageToImageFilter.h"
#include "itkImageRegionConstIterator.h"
#include "vnsMacro.h"
#include "vnsUtilities.h"
namespace vns
{
/** \class ShadowVariationThresholdImageFilter
* \brief This class detects shadows caused by clouds outside the image.
*
* WWhen a ratio of the reflectance of date D and the composite image of date D-1 is below
* a threshold (for the red band), the pixel is considered as a shadow.
* The threshold increase with time delay between the image acquisition and the reference
* reflectance date.
* The detection is not activated above water surfaces to avoid false detection of shadows.
* It is only activated in the zone where clouds outside the image could cast shadows within image.
*
* The input images are otb::VectorImage (images of reflectance).
* The input mask and the image of date are otb::Image.
* The output mask is an otb::Image.
*
* \author CS Systemes d'Information
*
* \sa ImageToImageFilter
*
* \ingroup L2
*
*/
template<class TInputImage, class TInputMask, class TOutputImage>
class ShadowVariationThresholdImageFilter : public itk::ImageToImageFilter<TInputImage, TOutputImage>
{
public:
/** Standard class typedefs. */
typedef ShadowVariationThresholdImageFilter Self;
typedef itk::ImageToImageFilter<TInputImage, TOutputImage> Superclass;
typedef itk::SmartPointer<Self> Pointer;
typedef itk::SmartPointer<const Self> ConstPointer;
/** Type macro */
itkNewMacro(Self)
/** Creation through object factory macro */
itkTypeMacro(ShadowVariationThresholdImageFilter, ImageToImageFilter )
/** Some convenient typedefs. */
typedef typename Superclass::InputImageType InputImageType;
typedef typename InputImageType::ConstPointer InputImageConstPointer;
typedef typename InputImageType::Pointer InputImagePointer;
typedef typename InputImageType::RegionType RegionType;
typedef typename InputImageType::PixelType InputImagePixelType;
typedef typename InputImageType::SizeType SizeType;
typedef typename InputImageType::InternalPixelType InputInternalPixelType;
typedef TInputMask InputMaskType;
typedef typename InputMaskType::Pointer InputMaskPointer;
typedef typename InputMaskType::ConstPointer InputMaskConstPointer;
typedef typename InputMaskType::PixelType InputMaskPixelType;
typedef typename Superclass::OutputImageType OutputImageType;
typedef typename OutputImageType::Pointer OutputImagePointer;
typedef typename OutputImageType::RegionType OutputImageRegionType;
typedef typename OutputImageType::PixelType OutputImagePixelType;
// No_data pixel value accessors
itkSetMacro(NoData, RealNoDataType)
itkGetConstReferenceMacro(NoData, RealNoDataType)
// CorrelThreshold parameter accesors
itkSetMacro(ThresholdValue, double)
itkGetConstReferenceMacro(ThresholdValue, double)
/** Set the image of the surface reflectance ratio*/
vnsSetGetInputRawMacro( ReflRatio, InputImageType ,0)
/** Set the outside cloud shadow mask */
vnsSetGetInputRawMacro( IPCLDOutShadInput , InputMaskType , 1)
/** Get the shadows mask from clouds outside image */
OutputImageType*
GetIPCLDShadVarOutput()
{
return static_cast<OutputImageType*>(this->itk::ProcessObject::GetOutput(0));
}
protected:
/** Constructor */
ShadowVariationThresholdImageFilter();
/** Destructor */
virtual
~ShadowVariationThresholdImageFilter();
/** Multi-thread version GenerateData. */
void
ThreadedGenerateData(const OutputImageRegionType& outputRegionForThread, itk::ThreadIdType threadId);
/** PrintSelf method */
virtual void
PrintSelf(std::ostream& os, itk::Indent indent) const;
private:
ShadowVariationThresholdImageFilter(const Self&); //purposely not implemented
void
operator=(const Self&); //purposely not implemented
/** No_data value */
RealNoDataType m_NoData;
/** Declaration of the threshold on reflectance ratio */
double m_ThresholdValue;
};
} // End namespace vns
#ifndef VNS_MANUAL_INSTANTIATION
#include "vnsShadowVariationThresholdImageFilter.txx"
#endif
#endif /* __vnsShadowVariationThresholdImageFilter_h */
| [
"[email protected]"
] | |
ff4c5a831aefa332c98efdd64b07becbb2a25a04 | 498dab3961bd056615ebcca32f5b5d89122d5efe | /external/glm/gtc/noise.hpp | b4a33bb60b3d6c6c257fff68cc416d29a8a00121 | [
"MIT"
] | permissive | andy-thomason/Vookoo | 3ee6b24e798afcca0d228ff5444b5e7577f8369a | d24318c9bf9dbbd38c596353bd7f9eacbab0e862 | refs/heads/master | 2023-08-29T06:35:01.669135 | 2022-06-15T18:47:30 | 2022-06-20T14:59:56 | 52,352,579 | 551 | 66 | MIT | 2022-08-08T12:36:18 | 2016-02-23T11:00:22 | C++ | UTF-8 | C++ | false | false | 1,508 | hpp | /// @ref gtc_noise
/// @file glm/gtc/noise.hpp
///
/// @see core (dependence)
///
/// @defgroup gtc_noise GLM_GTC_noise
/// @ingroup gtc
///
/// Include <glm/gtc/noise.hpp> to use the features of this extension.
///
/// Defines 2D, 3D and 4D procedural noise functions
/// Based on the work of Stefan Gustavson and Ashima Arts on "webgl-noise":
/// https://github.com/ashima/webgl-noise
/// Following Stefan Gustavson's paper "Simplex noise demystified":
/// http://www.itn.liu.se/~stegu/simplexnoise/simplexnoise.pdf
#pragma once
// Dependencies
#include "../detail/setup.hpp"
#include "../detail/qualifier.hpp"
#include "../detail/_noise.hpp"
#include "../geometric.hpp"
#include "../common.hpp"
#include "../vector_relational.hpp"
#include "../vec2.hpp"
#include "../vec3.hpp"
#include "../vec4.hpp"
#if GLM_MESSAGES == GLM_MESSAGES_ENABLED && !defined(GLM_EXT_INCLUDED)
# pragma message("GLM: GLM_GTC_noise extension included")
#endif
namespace glm
{
/// @addtogroup gtc_noise
/// @{
/// Classic perlin noise.
/// @see gtc_noise
template<length_t L, typename T, qualifier Q>
GLM_FUNC_DECL T perlin(
vec<L, T, Q> const& p);
/// Periodic perlin noise.
/// @see gtc_noise
template<length_t L, typename T, qualifier Q>
GLM_FUNC_DECL T perlin(
vec<L, T, Q> const& p,
vec<L, T, Q> const& rep);
/// Simplex noise.
/// @see gtc_noise
template<length_t L, typename T, qualifier Q>
GLM_FUNC_DECL T simplex(
vec<L, T, Q> const& p);
/// @}
}//namespace glm
#include "noise.inl"
| [
"[email protected]"
] | |
c5a02ccb0912e8f12ed93468314272e32c998b2a | 801f7ed77fb05b1a19df738ad7903c3e3b302692 | /refactoringOptimisation/differentiatedCAD/occt-min-topo-src/src/MoniTool/MoniTool_SignText.cxx | 8a0be6eacf9d36ea63896330bfce03bfb0d81ea8 | [] | no_license | salvAuri/optimisationRefactoring | 9507bdb837cabe10099d9481bb10a7e65331aa9d | e39e19da548cb5b9c0885753fe2e3a306632d2ba | refs/heads/master | 2021-01-20T03:47:54.825311 | 2017-04-27T11:31:24 | 2017-04-27T11:31:24 | 89,588,404 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,157 | cxx | // Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
#include <MoniTool_SignText.hxx>
#include <Standard_Transient.hxx>
#include <Standard_Type.hxx>
#include <TCollection_AsciiString.hxx>
TCollection_AsciiString MoniTool_SignText::TextAlone
(const Handle(Standard_Transient)& ent) const
{
Handle(Standard_Transient) nulctx; // no context
TCollection_AsciiString atext = Text (ent,nulctx);
if (atext.Length() == 0) {
if (ent.IsNull()) atext.AssignCat ("(NULL)");
else atext.AssignCat (ent->DynamicType()->Name());
}
return atext;
}
| [
"[email protected]"
] | |
87eaf8f12389f7542c70948771ffab1d763bc27a | eea72893d7360d41901705ee4237d7d2af33c492 | /src/rich/CsRCLikeAll05.cc | 924c25c1d0de1869811e688242f2f6edc65ba442 | [] | no_license | lsilvamiguel/Coral.Efficiencies.r14327 | 5488fca306a55a7688d11b1979be528ac39fc433 | 37be8cc4e3e5869680af35b45f3d9a749f01e50a | refs/heads/master | 2021-01-19T07:22:59.525828 | 2017-04-07T11:56:42 | 2017-04-07T11:56:42 | 87,541,002 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 37,720 | cc | /*!
\File CsRCLikeAll05.cc
\----------------------------
\brief CsRCLikeAll05 class implementation.
\author Paolo Schiavon
\version 1.0
\date May 2004
*/
#include <iostream>
#include <ostream>
#include <cstdio>
#include <iomanip>
#include "CsOpt.h"
#include "CsHist.h"
#include "CsHistograms.h"
//------------------------------
#include "CsRCLikeAll.h"
#include "CsRCLikeAll05.h"
#include "CsRCParticle.h"
#include "CsRCCluster.h"
#include "CsRCEventPartPhotons.h"
#include "CsRCPartPhotons.h"
#include "CsRCPhoton.h"
#include "CsRCHistos.h"
#include "CsRCRecConst.h"
#include "CsRCExeKeys.h"
#include "CsErrLog.h"
#include "CsRCMirrors.h"
#include "CsRCDetectors.h"
#include "CsRCUty.h"
//------------------------------
using namespace std;
using namespace CLHEP;
//===========================================================================
CsRCLikeAll05::CsRCLikeAll05( const CsRCPartPhotons* papho ):
//-------------------------------------------------------------
CsRCLikeAll() {
pPartPhot_ = papho;
}
//===========================================================================
CsRCLikeAll05::~CsRCLikeAll05() {}
//----------------------------------
extern "C" {
float prob_( const float&, const int& );
float erf_( const float& );
}
//===========================================================================
double CsRCLikeAll05::normSignal( const double theIpo ) {
//---------------------------------------------------------
//- compute Signal normalization for Likelihood
// -------------------------------------------
//- Paolo - May 2004
// Rev. January 2005
// Rev. May 2006
CsRCRecConst* cons = CsRCRecConst::Instance();
static const double TwoPI = cons->TwoPI();
static const double Drad = 360./ TwoPI;
int sz = pPartPhot_->lPhotons().size();
static const bool exeFrac = true;
//static const bool exeFrac = false;
//@@--------------------------------
CsRCHistos& hist = CsRCHistos::Ref();
int level = hist.levelBk();
bool doHist = false;
if ( level >= 2 ) doHist = true;
double xh, yh, wh;
bool testHist = true;
//@@--------------------
static int kOffHi = cons->kOffHi();
static CsHist1D *hRC0011 = NULL;
static CsHist1D *hRC0012 = NULL;
static CsHist1D *hRC0013 = NULL;
static bool firstCall = true;
if( firstCall ) {
firstCall = false;
std::cout << " Useful Photons ";
if( exeFrac ) std::cout << "ON";
else std::cout << "OFF";
std::cout << std::endl;
if ( testHist ) {
CsHistograms::SetCurrentPath("/RICH");
stringstream Title;
stringstream hNtest1;
stringstream hNtest2;
stringstream hNtest3;
Title << "d-nPhotExp";
hNtest1 << kOffHi + 11;
hRC0011 = new CsHist1D( hNtest1.str(), Title.str(), 100, -50., 50. );
Title << "nPhotExpP-K/sqP";
hNtest2 << kOffHi + 12;
hRC0012 = new CsHist1D( hNtest2.str(), Title.str(), 200, -0.01, 0.19);
Title << "nPhotExpP-K/sqP";
hNtest3 << kOffHi + 13;
hRC0013 = new CsHist1D( hNtest3.str(), Title.str(), 100, -50., 50. );
CsHistograms::SetCurrentPath("/");
}
}
//dump_ = true;
dump_ = false;
//useOldCode_ = true;
useOldCode_ = false;
//@@-------------------
xHole_ = 100.;
yHole_ = 60.;
rPipe_ = 50.;
//@@-------------
bool splitPatt = false;
bool newPF = false;
static int kEventC = -1;
int kEvent = CsRichOne::Instance()->kEvent();
static const CsRCPartPhotons* pPartPhotC = NULL;
if( kEvent != kEventC || pPartPhotC != pPartPhot_ ) {
newPF = true;
std::list<int> lSelCats = pPartPhot_->lSelCats();
std::list<int>::iterator isc = lSelCats.begin();
//for( isc=lSelCats.begin(); isc!=lSelCats.end(); isc++ )
//std::cout << (*isc) << " ";
//std::cout << std::endl;
int iCast = (*isc);
if( iCast > 7 ) splitPatt = false;
else {
for( isc=lSelCats.begin(); isc!=lSelCats.end(); isc++ ) {
if( (*isc) > 7 ) { splitPatt = true; break; }
}
}
splitPatt_ = splitPatt;
// ----------------------
if( dump_ )
std::cout << "CsRCLikeAll05 : === new partPhoton " << sz << std::endl;
}
kEventC = kEvent;
pPartPhotC = pPartPhot_;
CsRCPartPhotons* papho = const_cast<CsRCPartPhotons*>(pPartPhot_);
static float nPhotEx = 0.;
//- Compute expected number of Signal photons :
// -------------------------------------------
double theIrad = theIpo / 1000.;
float pathLen = pPartPhot_->pPart()->pathLen();
//nPhotEx = cons->nZero() * pathLen/10. * theIrad*theIrad;
nPhotEx = papho->nPhotExpct( theIpo );
double nPhotExS = 0.;
nPhotExS = papho->nPhotExpctCat( theIpo );
//-------------------------------------------
if( testHist ) {
if( pPartPhot_->likeONLY() ) {
xh = nPhotExS - nPhotEx;
if( hRC0011 ) hRC0011->Fill( xh );
// ---------------------------------
xh = nPhotExS - sz;
if( hRC0013 ) hRC0013->Fill( xh );
// ---------------------------------
static double nPhotExP;
if( pPartPhot_->pionONLY() ) nPhotExP = nPhotEx;
static double nPhotExK;
if( pPartPhot_->kaonONLY() && nPhotExP > 0. ) {
nPhotExK = nPhotEx;
//std::cout << "CsRCLikeAll05 " << nPhotExP << " " << nPhotExK
//<< " " << sqrt( nPhotExP ) << " "
//<< papho->pPart()->mom() << std::endl;
xh = ( nPhotExP - nPhotExK ) / sqrt( nPhotExP );
if( hRC0012 ) hRC0012->Fill( xh );
// ---------------------------------
}
}
}
//std::cout << "CsRCLikeAll05 " << nPhotEx << " " << nPhotExS << std::endl;
nPhotEx_ = nPhotEx;
// ------------------
static float fracUse = 0.;
//- Compute average photon survival prob. :
// ---------------------------------------
fracUse = 1.;
fracUsePhiSet_ = false;
if( exeFrac ) {
if( dump_ )
std::cout << "CsRCLikeAll05 : == exeFrac " << sz << std::endl;
int kDetPart = pPartPhot_->kDetPart();
Hep3Vector vPoPhot0e = pPartPhot_->pPart()->vPosEmP();
Hep3Vector vDcPart0e = pPartPhot_->pPart()->vDirIn();
CsRCMirrors *mirr = CsRCMirrors::Instance();
CsRCDetectors *dets = CsRCDetectors::Instance();
std::list<CsRCMirrorNom*> lMirrNom = mirr->lMirrNom();
std::list<CsRCMirrorNom*>::iterator in = lMirrNom.begin();
std::list<CsRCPhotonDet*> lPhoDet = dets->lPhoDet();
std::list<CsRCPhotonDet*>::iterator id = lPhoDet.begin();
// if( id == NULL || in == NULL ) return 0.;
if( id == lPhoDet.end() || in == lMirrNom.end() ) return 0.;
//--- inverse rotation
int kDetClu = kDetPart;
if( useOldCode_ ) {
if( kDetClu == 0 ) id++; // ???
if( kDetClu == 1 ) in++;
} else {
if( kDetClu == 1 ) { in++; id++; }
}
Hep3Vector vPoC0( (*in)->vC0() );
vPoC0 += mirr->vCorPoPa0();
float RR = mirr->RRv( kDetClu );
Hep3Vector vDcPartW = pPartPhot_->vDcPartW()[kDetClu];
Hep3Vector vPoPaMirr0 = pPartPhot_->pPart()->vPoPaMir0()[kDetPart];
//std::cout << vPoPaMirr0.x() << " " << vPoPaMirr0.y() << std::endl;
//std::cout << sqrt(pow(vPoPaMirr0.x(),2)+pow(vPoPaMirr0.y(),2))
// << std::endl;
double thePhot = theIpo / 1000.;
int nStepL = 10;
//@@-----------------
int nStepL2 = nStepL/2;
double dPath = pathLen / float( nStepL );
int nStepP = 36;
//@@-----------------
double dPhi = 360. / float( nStepP );
dPhi_ = dPhi;
int nTot = 0;
int nGood = 0;
//--- loop on photon angle Phi (to Y axis) :
for( int stepp=0; stepp<nStepP; stepp++ ) {
double phiPhot0 = pPartPhot_->lPhotons().front()->phiA() / Drad;
double phiPhot = 0.;
int nTotl = 0;
int nGoodl = 0;
//----- loop on photon position along part path :
for( int stepl=-nStepL2; stepl<=nStepL2; stepl++ ) {
Hep3Vector vPoPhot0 = vPoPhot0e + float( stepl )*dPath * vDcPart0e;
if( useOldCode_ ) phiPhot = (float( stepp ) * dPhi) / Drad;
else phiPhot = phiPhot0 + (float( stepp ) * dPhi) / Drad;
double tga, tgb;
tga = tan( thePhot ) * cos( phiPhot );
tgb = tan( thePhot ) * sin( phiPhot );
Hep3Vector vDcPhotWw( tga, tgb, 1.);
vDcPhotWw = vDcPhotWw.unit();
double theP, phiP;
Hep3Vector vDcPhotW = CsRCUty::Instance()->
rotfbcc( -1., vDcPartW, vDcPhotWw, theP, phiP );
// ----------------------------------------------
HepVector vrot( 3, 0 );
vrot[0] = vDcPhotW.x();
vrot[1] = vDcPhotW.y();
vrot[2] = vDcPhotW.z();
HepVector vPhot = (*id)->rotMatrix() * vrot;
Hep3Vector vDcPhot0( vPhot[0], vPhot[1], vPhot[2] );
Hep3Vector vPhotMirr0 =
mirr->vImpMir( vPoPhot0, vDcPhot0, vPoC0, RR );
// ----------------------------------------------
bool Hole = false;
double elips = pow( vPhotMirr0.x()/xHole_, 2 ) +
pow( vPhotMirr0.y()/yHole_, 2 ) - 1.;
if( elips < 0. ) Hole = true;
//Hole = false;
bool Pipe = false;
double xx = vPhotMirr0.x() - vPoPhot0.x();
double yy = vPhotMirr0.y() - vPoPhot0.y();
double mm = yy / xx;
double qq = sqrt( xx*xx + yy*yy );
//double rr = fabs( (vPoPhot0.y() * xx - vPoPhot0.x() * yy) / qq );
//double pp = vPhotMirr0.x()*vPhotMirr0.x() +
// vPhotMirr0.y()*vPhotMirr0.y();
double ssp, ssm;
if( vPoPhot0.x()*vPoPhot0.x() + vPoPhot0.y()*vPoPhot0.y()
< rPipe_*rPipe_ ) Pipe = true;
else if( vPhotMirr0.x()*vPhotMirr0.x()
+ vPhotMirr0.y()*vPhotMirr0.y()
< rPipe_*rPipe_ ) Pipe = true;
else if( fabs( (vPoPhot0.y()* xx - vPoPhot0.x()* yy)/ qq )
< rPipe_ ) {
//ssp = vPoPhot0.x() + vPoPhot0.y() * mm;
//ssm = vPhotMirr0.x() + vPhotMirr0.y() * mm;
//if( (ssp < 0. && ssm > 0.) || (ssm < 0. && ssp > 0.) )
//Pipe = true;
double aa = tga*tga + tgb*tgb;
double bb = tga*vPoPhot0.x() + tgb*vPoPhot0.y();
double cc = vPoPhot0.x()*vPoPhot0.x() + vPoPhot0.y()*vPoPhot0.y()
- rPipe_*rPipe_;
double delta = bb*bb - aa*cc;
if( delta > 0. ) {
double zp1 = ( -bb + sqrt( delta )) / aa;
double zp2 = ( -bb - sqrt( delta )) / aa;
if( !(vPoPhot0.z() > zp1 && vPoPhot0.z() > zp2) ) Pipe = true;
}
}
//Pipe = false;
nTotl++;
if( !Hole && !Pipe ) nGoodl++;
nTot++;
if( !Hole && !Pipe ) nGood++;
//std::cout << true << Hole << " " << Pipe << " " << rr << " "
//<< vPoPhot0.x() << " " << xPhotMirr0 << " " << mm << " "
//<< ssp << " " << ssm << std::endl;
}
//cout << stepp << " " << nGoodl << " " << nTotl << endl;
if( nTotl == 0 ) nTotl = 1;
fracUsePhi_[stepp] = float( nGoodl ) / float( nTotl );
// -----------------------------------------------------
//^fracUsePhiSet_ = true;
// ---------------------
}
fracUsePhiSet_ = true;
// ---------------------
//cout << "------ " << nGood << " " << nTot << endl;
if( nTot == 0 ) nTot = 1;
fracUse = float( nGood ) / float( nTot );
// ----------------------------------------
//std::cout << "05All-N " << nPhotEx << " " << fracUse << std::endl;
}
fracUse_ = fracUse;
// ------------------
papho->setFracUse( fracUse );
if( dump_ ) {
static float fracUseS;
if( newPF ) {
fracUseS = fracUse;
std::cout << setprecision(4);
std::cout << "CsRCLikeAll05 : fracUseS " << fracUse << std::endl;
std::cout << setprecision(2);
} else {
if( fracUse != fracUseS ) {
std::cout << setprecision(4);
std::cout << "CsRCLikeAll05 : ... fracUse " << fracUse << std::endl;
std::cout << setprecision(2);
}
}
}
//- Histograms :
// ------------
if( doHist ) {
xh = nPhotEx;
yh = fracUse;
if( hist.hRC1510 ) hist.hRC1510->Fill( xh, yh );
// -----------------------------------------------
Hep3Vector vPoPart0 = pPartPhot_->pPart()->vPosIn();
double rr0 = sqrt( pow( vPoPart0.x(), 2 ) + pow( vPoPart0.y(), 2 ) );
Hep3Vector vDcPart0 = pPartPhot_->pPart()->vDirIn();
double the0 = acos( vDcPart0.z() ) * 1000.;
xh = the0;
yh = rr0;
wh = fracUse;
if( hist.hRC1514 ) hist.hRC1514->Fill( xh, yh, wh );
// ---------------------------------------------------
xh = the0;
yh = rr0;
if( hist.hRC1515 ) hist.hRC1515->Fill( xh, yh );
// -----------------------------------------------
if( fracUse == 0. ) {
if( hist.hRC1624 ) hist.hRC1624->Fill( xh, yh );
// -----------------------------------------------
}
if( fracUse == 1. ) {
if( hist.hRC1625 ) hist.hRC1625->Fill( xh, yh );
// -----------------------------------------------
}
}
if( exeFrac ) nPhotEx *= fracUse;
//----------------------------------
//std::cout << theIpo << " " << pPartPhot_
// << " " << fracUse << " " << nPhotEx << std::endl;
double normS = nPhotEx;
if( theIpo <= 0. ) normS = 0.;
if( doHist ) {
xh = normS;
if( hist.hRC1577 ) hist.hRC1577->Fill( xh );
// -------------------------------------------
}
return normS;
}
//===========================================================================
double CsRCLikeAll05::normBackgr( const double theIpo ) {
//---------------------------------------------------------
//- compute Background normalization for Likelihood
// -----------------------------------------------
// NOT used - to be CHECKED!
//- Paolo - May 2004
// Rev. May 2006
// TO BE CHECKED!
CsRCRecConst* cons = CsRCRecConst::Instance();
static const double TwoPI = cons->TwoPI();
int sz = pPartPhot_->lPhotons().size();
static const float focLen = pPartPhot_->pPart()->pMirPart()->RR() / 2.;
//static const bool exeInt = false;
static const bool exeInt = true;
//@@--------------------------------
CsRCHistos& hist = CsRCHistos::Ref();
int level = hist.levelBk();
bool doHist = false;
if ( level >= 2 ) doHist = true;
double xh, yh, wh;
static bool firstCall = true;
if( firstCall ) {
firstCall = false;
std::cout << " Back Int ";
if( exeInt ) std::cout << "ON";
else std::cout << "OFF";
}
//- Compute Background integral :
//-------------------------------
double normB = 0.;
static const double theMax = 70./ 1000.;
static const int nThe = 23;
static const int nPhi = 24;
//@@--------------------------
//^long double backInt = 0.;
//^long double backIntS = 0.;
static long double backInt = 0.;
static long double backIntS = 0.;
static int kEventC = -1;
int kEvent = CsRichOne::Instance()->kEvent();
static const CsRCPartPhotons* pPartPhotC = NULL;
if( exeInt ) {
if( kEvent != kEventC || pPartPhotC != pPartPhot_ ) {
if( dump_ )
std::cout << "CsRCLikeAll05 : exeInt " << sz << std::endl;
backInt = 0.;
double dThe = theMax / float( nThe );
double dPhi = TwoPI / float( nPhi );
//std::cout << " " << dThe << " " << dPhi << std::endl;
std::list<CsRCPhoton*> lPhotons = pPartPhot_->lPhotons();
CsRCCluster clu( *(lPhotons.front()->ptToClu()) );
int kDetPart = pPartPhot_->kDetPart();
double xPade = pPartPhot_->pPart()->vPade()[kDetPart].x();
double yPade = pPartPhot_->pPart()->vPade()[kDetPart].y();
//std::cout << " " << xPade << " " << yPade << std::endl;
int iPhot = 0;
for( int kThe=0; kThe<nThe; kThe++ ) {
for( int kPhi=0; kPhi<nPhi; kPhi++ ) {
double the = kThe*dThe + dThe/2.;
double phi = kPhi*dPhi + dPhi/2.;
double xClu = xPade + focLen*the * cos( phi );
double yClu = yPade + focLen*the * sin( phi );
clu.setX( xClu );
clu.setY( yClu );
double backWgt = 0.;
if( clu.getBackWgt( backWgt ) ) {
backInt += backWgt * focLen*the * focLen*dThe * dPhi;
// ----------------------------------------------------
//std::cout << "BackInt" << " " << backWgt << " "
// << iPhot << " "
// << the << " " << phi << " " << xClu << " "
// << yClu <<std::endl;
iPhot++;
}
}
}
//backInt /= (TwoPI/2. * theMax*theMax);
//std::cout << "BackInt = " << backInt << " " << iPhot << " "
// << lPhotons.size() << std::endl;
backIntS = 0.;
if( splitPatt_ ) {
std::vector<double> vySplitLLim;
vySplitLLim = pPartPhot_->vySplitLLim();
if( vySplitLLim.size() < 2 ) {
vySplitLLim.clear();
vySplitLLim.push_back( 0. );
vySplitLLim.push_back( 0. );
}
int jDetPart = 1 - kDetPart;
xPade = pPartPhot_->pPart()->vPade()[jDetPart].x();
yPade = pPartPhot_->pPart()->vPade()[jDetPart].y();
int sign = 1 - 2 * jDetPart;
int jPhot = 0;
for( int kThe=0; kThe<nThe; kThe++ ) {
for( int kPhi=0; kPhi<nPhi; kPhi++ ) {
double the = kThe*dThe + dThe/2.;
double phi = kPhi*dPhi + dPhi/2.;
double xClu = xPade + focLen*the * cos( phi );
double yClu = yPade + focLen*the * sin( phi );
if( (yClu - vySplitLLim[jDetPart])* sign > 0. ) {
//std::cout << jDetPart << " " << yClu << " "
//<< vySplitLLim[jDetPart] << std::endl;
clu.setX( xClu );
clu.setY( yClu );
double backWgt = 0;
if( clu.getBackWgt( backWgt ) ) {
backIntS += backWgt * focLen*the * focLen*dThe * dPhi;
// -----------------------------------------------------
//std::cout << "BackIntS" << " " << backWgt << " " << iPhot
//<< " " << the << " " << phi << " " << xClu << " "
//<< yClu <<std::endl;
jPhot++;
}
}
}
}
}
//std::cout << "BackInt " << backInt << " " << backIntS
// << " " << lPhotons.size() << " " << splitPatt_ << std::endl;
//----- Histograms :
// ------------
if( doHist ) {
xh = backInt;
yh = backIntS;
if( hist.hRC1511 ) hist.hRC1511->Fill( xh, yh );
// -----------------------------------------------
int kDetPart = pPartPhot_->pPart()->kDetPart();
float ddpdet = pPartPhot_->pPart()->ddPaDet()[kDetPart];
xh = ddpdet;
yh = backInt;
if( kDetPart == 0 ) {
if( hist.hRC1518 ) hist.hRC1518->Fill( xh, yh );
// -----------------------------------------------
}
if( kDetPart == 1 ) {
if( hist.hRC1519 ) hist.hRC1519->Fill( xh, yh );
// -----------------------------------------------
}
}
}
kEventC = kEvent;
pPartPhotC = pPartPhot_;
normB = backInt + backIntS;
// --------------------------
}
else normB = 1.;
// ----------
normB_ = normB;
// --------------
if( doHist ) {
xh = normB;
if( hist.hRC1578 ) hist.hRC1578->Fill( xh );
// -------------------------------------------
}
return normB;
}
//===========================================================================
double CsRCLikeAll05::likeSignal( const CsRCPhoton* pPhot,
//----------------------------------------------------------
const double theIpo ) {
//- compute Signal value for Likelihood
// -----------------------------------
//- Paolo - May 2004
// Rev. May 2006
//if( theIpo < 50. ) return 0.;
CsRCRecConst* cons = CsRCRecConst::Instance();
static const double TwoPI = cons->TwoPI();
static const double sq2pi = sqrt( TwoPI );
static const double Drad = 360./ TwoPI;
int sz = pPartPhot_->lPhotons().size();
CsRCDetectors *dets = CsRCDetectors::Instance();
//static const float pipeLen = dets->zExitWind() - dets->zEntrWind();
CsRCHistos& hist = CsRCHistos::Ref();
int level = hist.levelBk();
bool doHist = false;
if ( level >= 2 ) doHist = true;
double xh, yh, wh;
static const bool exeSpl = false;
//@@--------------------------------
static const bool exeSig = true;
//static const bool exeSig = false;
//@@-------------------------------
static bool firstCall = true;
if( firstCall ) {
firstCall = false;
std::cout << " Signal Spl ";
if( exeSpl ) std::cout << "ON";
else std::cout << "OFF";
std::cout << " Signal Corr ";
if( exeSig ) std::cout << "ON";
else std::cout << "OFF";
std::cout << std::endl;
}
//- Compute Signal term :
// ---------------------
double thePhot = pPhot->the();
double sigPhot = pPhot->sigmaPhoPid( pPartPhot_ );
double signal = 0.;
if( sigPhot > 0.) {
double qSw = (thePhot - fabs( theIpo )) / sigPhot;
signal = exp( - 0.5* qSw*qSw ) / (sigPhot*sq2pi);
//-----------------------------------------------------------
}
//signal *= 1./ (TwoPI*theIpo); // test int
//signal *= thePhot / (TwoPI*theIpo);
//signal *= thePhot / theIpo;
//@@----------------------------------
static int kDetPart = 0;
static float nPhotEx = 0.;
static std::vector<double> vySplitLLim;
static std::vector<double> cosphi0;
static const float focLen = pPartPhot_->pPart()->pMirPart()->RR() / 2.;
int kDetClu = pPhot->kDetClu();
static CsRCPhoton* pPhotF = NULL;
pPhotF = pPartPhot_->lPhotons().front();
double theIrad = theIpo / 1000.;
if( pPhot == pPhotF ) {
kDetPart = pPartPhot_->kDetPart();
vySplitLLim = pPartPhot_->vySplitLLim();
if( vySplitLLim.size() < 2 ) {
vySplitLLim.clear();
vySplitLLim.push_back( 0. );
vySplitLLim.push_back( 0. );
}
nPhotEx = nPhotEx_;
// ------------------
if( splitPatt_ ) {
cosphi0.clear();
for( int kDet=0; kDet<2; kDet++ ) {
//double rOnDet = theIrad * ( pPartPhot_->pPart()->vPade()[kDet] -
// pPartPhot_->vPoPaMirW()[kDet] ).mag();
double rOnDet = (theIrad + 0.003) * focLen;
double yPade = pPartPhot_->pPart()->vPade()[kDet].y();
double dd = fabs( yPade - vySplitLLim[kDet] );
double cos = 1.;
if( rOnDet > 0. ) cos = fabs( dd / rOnDet );
//cout << rOnDet << " " << cos << endl;
if( cos > 1. ) cos = 1.;
cosphi0.push_back( cos );
}
}
//std::cout << "----- " << splitPatt_
// << " " << cosphi0[0] << " " << cosphi0[1]
// << " " << vySplitLLim[0] << " " << vySplitLLim[1]
// << " " << theIpo << std::endl;
}
//- Split rings effect (do NOT use) :
// ---------------------------------
float normSpl = 1.;
if( exeSpl ) {
double cosphi = 0.;
if( splitPatt_ && cosphi0[kDetClu] < 1. ) {
double xc = pPhot->ptToClu()->xc();
double yc = pPhot->ptToClu()->yc();
double xPade = pPartPhot_->pPart()->vPade()[kDetClu].x();
double yPade = pPartPhot_->pPart()->vPade()[kDetClu].y();
double tanphi = 0.;
//std::cout << "--- " << dd << " " << rOnDet << std::endl;
//std::cout << xc << " " << yc << " "
// << xPade << " " << yPade << " " << dd << std::endl;
int sign = 1 - 2 * kDetPart;
if( kDetClu == kDetPart ) {
if( ( yc - vySplitLLim[kDetClu] )* sign < 0. ) {
if((yc - yPade) > 0.) tanphi = (xc - xPade) / (yc - yPade);
cosphi = 1./ sqrt( 1.+ tanphi*tanphi );
if( cosphi > cosphi0[kDetClu] ) normSpl = cosphi0[kDetClu]/cosphi;
// ---------------------------------
//else normSpl = 0.;
}
//std::cout << kDetClu << " " << cosphi << " " << cosphi0[kDetClu]
// << " " << normSpl << std::endl;
}
tanphi = 0.;
if( kDetClu != kDetPart ) {
normSpl = 0.;
// ------------
//if( ( yc - vySplitLLim[kDetClu] )* sign < 0. ) {
if( ( yc - vySplitLLim[kDetClu] )* sign > 0. ) {
if((yc - yPade) > 0.) tanphi = (xc - xPade) / (yc - yPade);
cosphi = 1./ sqrt( 1.+ tanphi*tanphi );
if( cosphi > cosphi0[kDetClu] )
normSpl = 1.- cosphi0[kDetClu]/cosphi;
// -------------------------------------
else normSpl = 0.;
// ------------
}
//std::cout << kDetClu << " " << cosphi << " " << cosphi0[kDetClu]
// << " " << normSpl << std::endl;
}
}
}
//- Photon survival prob. :
// -----------------------
float probSig = 1.;
if( exeSig ) {
if( useOldCode_ ) fracUsePhiSet_ = false;
if( fracUsePhiSet_ ) {
if( dump_ )
if( pPhot == pPartPhot_->lPhotons().front() )
std::cout << "CsRCLikeAll05 : (Sig) " << sz << std::endl;
double phiPhot0 = pPartPhot_->lPhotons().front()->phiA();
double phiPhot = pPhot->phiA();
double diffPhi = phiPhot - phiPhot0;
if( diffPhi < 0. ) diffPhi = diffPhi + 360.;
if( diffPhi > 360. ) diffPhi = diffPhi - 360.;
//std::cout << "05All-S " << phiPhot << " " << phiPhot0 << " "
// << diffPhi << " " << dPhi_ << std::endl;
int kFrac = int( diffPhi / dPhi_ );
if( kFrac < 0 ) kFrac = 0;
if( kFrac > 35 ) kFrac = 35;
probSig = fracUsePhi_[kFrac];
// ----------------------------
//std::cout << "05All-S " << nPhotEx << " " << probSig << std::endl;
} else {
if( dump_ )
if( pPhot == pPartPhot_->lPhotons().front() )
std::cout << "CsRCLikeAll05 : exeSig " << sz << std::endl;
CsRCMirrors *mirr = CsRCMirrors::Instance();
float RR = mirr->RRv( kDetClu );
Hep3Vector vPoPhot0e = pPartPhot_->pPart()->vPosEmP();
Hep3Vector vDcPart0e = pPartPhot_->pPart()->vDirEmP();
double phiPhot = pPhot->phiA() / Drad;
thePhot = theIpo / 1000.;
//------------------------------
list<CsRCMirrorNom*> lMirrNom = mirr->lMirrNom();
list<CsRCMirrorNom*>::iterator in = lMirrNom.begin();
list<CsRCPhotonDet*> lPhoDet = dets->lPhoDet();
list<CsRCPhotonDet*>::iterator id = lPhoDet.begin();
// if( id == NULL || in == NULL ) return 0.;
if( id == lPhoDet.end() || in == lMirrNom.end() ) return 0.;
//----- inverse rotation
if( useOldCode_ ) {
if( kDetClu == 0 ) id++; // ???
if( kDetClu == 1 ) in++;
} else if( kDetClu == 1 ) { in++; id++; }
Hep3Vector vPoC0( (*in)->vC0() );
vPoC0 += mirr->vCorPoPa0();
Hep3Vector vDcPartW = pPartPhot_->vDcPartW()[kDetClu];
double tga, tgb;
tga = tan( thePhot ) * cos( phiPhot );
tgb = tan( thePhot ) * sin( phiPhot );
Hep3Vector vDcPhotWw( tga, tgb, 1.);
vDcPhotWw = vDcPhotWw.unit();
double theP, phiP;
Hep3Vector vDcPhotW = CsRCUty::Instance()->
rotfbcc( -1., vDcPartW, vDcPhotWw, theP, phiP );
// -----------------------------------------------
HepVector vrot( 3, 0 );
vrot[0] = vDcPhotW.x();
vrot[1] = vDcPhotW.y();
vrot[2] = vDcPhotW.z();
HepVector vPhot = (*id)->rotMatrix() * vrot;
Hep3Vector vDcPhot0( vPhot[0], vPhot[1], vPhot[2] );
//std::cout << vDcPhotWw << " " << vDcPhotW << " " << vDcPhot0
// <<std::endl;
double pathLen = pPartPhot_->pPart()->pathLen();
int nStep = 10;
double dPath = pathLen / float( nStep );
//----- in MRS
int nTot = 0;
int nGood = 0;
//----- loop on photon position along part path :
for( int step=-nStep/2; step<=nStep/2; step++ ) {
Hep3Vector vPoPhot0 = vPoPhot0e + float( step )*dPath * vDcPart0e;
//std::cout << vPoPhot0e << " " << vPoPhot0 << std::endl;
Hep3Vector vPhotMirr0 =
mirr->vImpMir( vPoPhot0, vDcPhot0, vPoC0, RR );
// ----------------------------------------------
bool Hole = false;
double elips = pow( vPhotMirr0.x()/xHole_, 2 ) +
pow( vPhotMirr0.y()/yHole_, 2 ) - 1.;
if( elips < 0. ) Hole = true;
//Hole = false;
bool Pipe = false;
double xx = vPhotMirr0.x() - vPoPhot0.x();
if( xx == 0.) continue;
double yy = vPhotMirr0.y() - vPoPhot0.y();
double mm = yy / xx;
double qq = sqrt( xx*xx + yy*yy );
//double rr = fabs( (vPoPhot0.y() * xx - vPoPhot0.x() * yy) / qq );
//double pp = vPhotMirr0.x()*vPhotMirr0.x() +
// vPhotMirr0.y()*vPhotMirr0.y();
double ssp, ssm;
if( vPoPhot0.x()*vPoPhot0.x() + vPoPhot0.y()*vPoPhot0.y()
< rPipe_*rPipe_ ) Pipe = true;
else if( vPhotMirr0.x()*vPhotMirr0.x()
+ vPhotMirr0.y()*vPhotMirr0.y()
< rPipe_*rPipe_ ) Pipe = true;
else if( fabs( (vPoPhot0.y()* xx - vPoPhot0.x()* yy)/ qq )
< rPipe_) {
//ssp = vPoPhot0.x() + vPoPhot0.y() * mm;
//ssm = vPhotMirr0.x() + vPhotMirr0.y() * mm;
//if( (ssp < 0. && ssm > 0.) || (ssm < 0. && ssp > 0.) )
//Pipe = true;
double aa = tga*tga + tgb*tgb;
double bb = tga*vPoPhot0.x() + tgb*vPoPhot0.y();
double cc = vPoPhot0.x()*vPoPhot0.x() + vPoPhot0.y()*vPoPhot0.y()
- rPipe_*rPipe_;
double delta = bb*bb - aa*cc;
if( delta > 0. ) {
double zp1 = ( -bb + sqrt( delta )) / aa;
double zp2 = ( -bb - sqrt( delta )) / aa;
if( !(vPoPhot0.z() > zp1 && vPoPhot0.z() > zp2) ) Pipe = true;
}
}
//Pipe = false;
nTot++;
if( !Hole && !Pipe ) nGood++;
//std::cout << Hole << " " << Pipe << std::endl;
}
if( nTot == 0 ) nTot = 1;
probSig = float( nGood ) / float( nTot );
// ----------------------------------------
//std::cout << "05All-S " << nPhotEx << " " << probSig << std::endl;
//std::cout << nPhotEx << " " << normSpl << " " << probSig
// << std::endl;
//std::cout << std::endl;
}
}
signal *= nPhotEx;
//-------------------
if( exeSpl ) signal *= normSpl;
//--------------------------------
if( exeSig ) signal *= probSig;
//--------------------------------
//- Histogramms :
// -------------
if( doHist ) {
xh = nPhotEx;
yh = probSig;
if( hist.hRC1512 ) hist.hRC1512->Fill( xh, yh );
// -----------------------------------------------
Hep3Vector vPoPart0 = pPartPhot_->pPart()->vPosIn();
double rr0 = sqrt( pow( vPoPart0.x(), 2 ) + pow( vPoPart0.y(), 2 ) );
Hep3Vector vDcPart0 = pPartPhot_->pPart()->vDirIn();
double the0 = acos( vDcPart0.z() ) * 1000.;
xh = the0;
yh = rr0;
wh = probSig;
if( hist.hRC1516 ) hist.hRC1516->Fill( xh, yh, wh );
// ---------------------------------------------------
xh = the0;
yh = rr0;
if( hist.hRC1517 ) hist.hRC1517->Fill( xh, yh );
// -----------------------------------------------
if( probSig == 0. ) {
if( hist.hRC1626 ) hist.hRC1626->Fill( xh, yh );
// -----------------------------------------------
}
if( probSig == 1. ) {
if( hist.hRC1627 ) hist.hRC1627->Fill( xh, yh );
// -----------------------------------------------
}
xh = normSpl;
yh = -1.;
if( kDetPart == 0 ) {
if( kDetClu == kDetPart ) yh = 0.5;
if( kDetClu != kDetPart ) yh = 1.5;
}
if( kDetPart == 1 ) {
if( kDetClu == kDetPart ) yh = 2.5;
if( kDetClu != kDetPart ) yh = 3.5;
}
if( hist.hRC1513 ) hist.hRC1513->Fill( xh, yh );
// -----------------------------------------------
if( cosphi0.size() >= 2 ) {
xh = cosphi0[kDetPart];
yh = 4.5;
if( hist.hRC1513 ) hist.hRC1513->Fill( xh, yh );
// -----------------------------------------------
}
if( pPartPhot_->likeONLY() ) {
xh = signal;
if( pPhot->isPMT() ) if( hist.hRC1574 ) hist.hRC1574->Fill( xh );
// -------------------------------------------
if( pPhot->isAPV() ) if( hist.hRC1575 ) hist.hRC1575->Fill( xh );
// -------------------------------------------
}
}
if( theIpo <= 0. ) signal = 0.;
return signal;
}
//===========================================================================
double CsRCLikeAll05::likeBackgr( const CsRCPhoton* pPhot,
//----------------------------------------------------------
const double theIpo ) {
//- compute Background value for Likelihood
// ---------------------------------------
//- Paolo - May 2004
// Rev. May 2006
//if( theIpo < 50. ) return 0.;
static const float focLen = pPartPhot_->pPart()->pMirPart()->RR() / 2.;
static const float factor = focLen/1000. * focLen/1000.;
int sz = pPartPhot_->lPhotons().size();
static bool firstCall = true;
if( firstCall ) {
firstCall = false;
}
CsRCHistos& hist = CsRCHistos::Ref();
int level = hist.levelBk();
bool doHist = false;
if ( level >= 2 ) doHist = true;
double xh, yh, wh;
//- Warning : kPhot is NOT sequential!
int kPhot = pPhot->kPhot();
double thePhot = pPhot->the();
//- from back-para-... .new-vector74 background map
// ---------------------------
//static const double backWgtMin = 0.0002;
static const double backWgtMin = 0.00001;
//@@----------------------------------------
static const CsRCPartPhotons* pPartPhotP = NULL;
if( kPhot >= 1000 ) {
if( pPartPhotP != pPartPhot_ ) {
std::cout << " RICHONE, CsRCLikeAll05::likeBackgr : "
<< " BUFFER Overflow! " << kPhot << " "
<< pPartPhot_->lPhotons().size() << std::endl;
}
pPartPhotP = pPartPhot_;
return backWgtMin;
// ------------------
}
double backgr = 0.;
double backWgt = 0.;
static int kEventC = -1;
static CsRCPartPhotons* pPartPhotC = NULL;
static CsRCPhoton* pPhotC = NULL;
static int kPhotC = -1;
int kEvent = CsRichOne::Instance()->kEvent();
//- Warning : pPartPhot can be the same for two conseq. events!
// also pPhot suspicious
if( kEvent != kEventC || pPartPhot_ != pPartPhotC ) {
phoBackSet_ = false;
pPhotC = const_cast<CsRCPhoton*>(pPhot);
kPhotC = kPhot;
//std::cout << "CsRCLikeAll05 : --- zeroPF " << std::endl;
} else {
if( kPhot == kPhotC ) {
phoBackSet_ = true;
//std::cout << "CsRCLikeAll05 : zeroF " << std::endl;
}
}
if( useOldCode_ ) phoBackSet_ = false;
if( phoBackSet_ ) {
if( dump_ ) if( kPhot == kPhotC )
std::cout << "CsRCLikeAll05 : (Back) " << sz << std::endl;
backgr = phoBack_[kPhot];
// ------------------------
} else {
if( dump_ ) if( kPhot == kPhotC )
std::cout << "CsRCLikeAll05 : = exeBack " << sz << std::endl;
backgr = backWgtMin;
if( pPhot->ptToClu()->getBackWgt( backWgt ) ) {
// ---------------------------------------
if( backWgt < backWgtMin ) backWgt = backWgtMin;
backgr = factor * backWgt * thePhot; // (3300/1000)**2
//backgr = factor * backWgt * thePhot/1000.;
// -----------------------------------
if( !useOldCode_ ) phoBack_[kPhot] = backgr;
}
else {
backWgt = backWgtMin;
backgr = factor * backWgt * thePhot;
if( !useOldCode_ ) phoBack_[kPhot] = backgr;
std::cout << " RICHONE, CsRCLikeAll05::likeBackgr() : "
<< "MINIMUM background assignment! - Ev. "
<< kEvent << " Phot. " << kPhot << std::endl;
}
}
kEventC = kEvent;
pPartPhotC = const_cast<CsRCPartPhotons*>(pPartPhot_);
//if( backgr == 0.) {
//if( pPartPhot_->likeONLY() ) {
//std::cout << setprecision( 12 ) << "LAll05 ";
//std::cout << kPhot << " "
// << log(backgr) << " " << backWgt << " " << thePhot << std::endl;
//}
//}
float normSpl = 1.;
// ------------------
//- Histograms :
// ------------
if( doHist ) {
int kDetPart = pPartPhot_->kDetPart();
int kDetClu = pPhot->kDetClu();
xh = normSpl;
yh = 10.5;
if( kDetPart == 0 ) {
if( kDetClu == kDetPart ) yh = 5.5;
if( kDetClu != kDetPart ) yh = 6.5;
}
if( kDetPart == 1 ) {
if( kDetClu == kDetPart ) yh = 7.5;
if( kDetClu != kDetPart ) yh = 8.5;
}
if( hist.hRC1513 ) hist.hRC1513->Fill( xh, yh );
// -----------------------------------------------
if( backgr > 0. ) {
xh = pPhot->ptToClu()->xc();
yh = pPhot->ptToClu()->yc();
wh = backgr;
if( hist.hRC1530 ) hist.hRC1530->Fill( xh, yh, wh );
// ---------------------------------------------------
if( hist.hRC1540 ) hist.hRC1540->Fill( xh, yh );
// -----------------------------------------------
}
if( pPartPhot_->likeONLY() ) {
xh = backgr;
if( pPhot->isPMT() ) if( hist.hRC1576 ) hist.hRC1576->Fill( xh );
// -------------------------------------------
if( pPhot->isAPV() ) if( hist.hRC1579 ) hist.hRC1579->Fill( xh );
// -------------------------------------------
}
}
return backgr;
}
//===========================================================================
double CsRCLikeAll05::getRingBackground( const double theReco ) {
//-----------------------------------------------------------------
//- Paolo - May 2004
//- NOT IMPLEMENTED !
CsRCRecConst * cons = CsRCRecConst::Instance();
static bool firstCall = true;
if( firstCall ) {
firstCall = false;
}
double corrBack = 0.;
return corrBack;
}
| [
"[email protected]"
] | |
46ed807805ddaddd867d79c2afc747fd402bd52d | 1abf985d2784efce3196976fc1b13ab91d6a2a9e | /opentracker/include/OpenTracker/core/Module.h | 455c6be4510d69ccce823beac989c519bcbf501d | [
"BSD-3-Clause"
] | permissive | dolphinking/mirror-studierstube | 2550e246f270eb406109d4c3a2af7885cd7d86d0 | 57249d050e4195982c5380fcf78197073d3139a5 | refs/heads/master | 2021-01-11T02:19:48.803878 | 2012-09-14T13:01:15 | 2012-09-14T13:01:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,294 | h | /* ========================================================================
* Copyright (c) 2006,
* Institute for Computer Graphics and Vision
* Graz University of Technology
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* Neither the name of the Graz University of Technology nor the names of
* its contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
* ========================================================================
* PROJECT: OpenTracker
* ======================================================================== */
/** header file for Module class.
*
* @author Gerhard Reitmayr
*
* $Id: Module.h 2114 2008-02-04 15:25:12Z bornik $
* @file */
/* ======================================================================= */
#ifndef _MODULE_H
#define _MODULE_H
#include "../dllinclude.h"
#include "ConfigNode.h"
#include "StringTable.h"
#include <OpenTracker/core/IRefCounted.h>
#include <OpenTracker/misc/Cptr.h>
/**
* Module is an abstract super class for all OpenTracker modules. A module
* is associated with a configuration element. If the configuration element
* is present, it is initialized with init. Then it is started. During the
* main loop in Context, pushEvent and pullEvent, and stop are periodically
* called. When the Context exits its main loop it calls close on all methods.
*
* This class provides empty implementations for all its methods instead of
* pure virtual functions, so that classes inheriting from it don't have to
* implement all methods in a trivial way.
* @author Gerhard Reitmayr
* @ingroup core
*/
namespace ot {
class OPENTRACKER_API Module
{
//members
protected:
/// check if this module appeared in the configuration section
int initialized;
/** pointer to the context this module is working in. It will be set
* by the initialize method.
*/
Context * context;
OT_DECLARE_IREFCOUNTED;
typedef Cptr<Module> Ptr;
public:
// static Context * contextx;
//methods
public:
/// constructor method
Module(): initialized(0), context(NULL) { OT_INITIALIZE_IREFCOUNTED; };
/// virtual destructor (as it befits any true class hierarchy)
virtual ~Module();
virtual void setContext(Context * c){ context = c; };
Context * getContext() const {return context;};
/**
* closes the module. A place for cleanup code etc.
* This class provides an empty implementation for subclasses not doing
* anything here. */
virtual void close() {};
/**
* initializes the tracker module. This class provides an implementation
* that sets the initialization flag to true. Subclasses should call this
* method, if they override it, before doing anything else. It takes the attributes of the
* element configuring this module and a local tree consisting of the
* children of the element. This tree must be build of Nodes.
* @param attributes StringTable of elements attribute values. Should be
* possibly , but is not for convenience.
* @param localTree pointer to root of configuration nodes tree
*/
virtual void init(StringTable& attributes, ConfigNode * localTree)
{
initialized = 1;
};
/**
* pulls event information out of the tracker tree. It enables the module
* to query any EventQueue or TimeDependend node in the shared memory. It
* is called after pushEvent was executed on each module.
*/
virtual void pullEvent() {};
/**
* pushes event information into the tracker tree. It enables the module
* to push new data into the tree by updating EventGenerator nodes and
* thereby triggering an event.
*/
virtual void pushEvent() {};
/**
* This method is called after initialisation is finished and before the
* main loop is started. It allows the module to finish any setups that
* need to be done before entering the main loop. */
virtual void start() {};
/**
* tests whether the module wants the tracker main loop to stop.
* @return 1 if main loop should stop, 0 otherwise. */
virtual int stop()
{
return 0;
};
/**
* This method should be called by the Node's factory, in order to register the Node with its Module.
* It should be overloaded by descendants that need to keep track of their Nodes.
*/
virtual void addNode(const Node * ){};
/**
* This method deregisters a node from the Module. It is called when removing a node from the graph.
* It should be overloaded by descendants that need to keep track of their Nodes.
*/
virtual void removeNode(Node *){};
/**
* tests whether the module was initialized or not.
* @return 1 of the module was initialized, 0 otherwise. */
int isInitialized()
{
return initialized;
};
friend class Context;
};
/*
#define OT_MODULE(MODNAME) OPENTRACKER_API static void registerModule (Context * context, void * data)
#define OT_MODULE_REGISTER_FUNC(MODNAME) \
OPENTRACKER_API void MODNAME::registerModule( Context * context , void * data)
#define OT_MODULE_REGISTRATION_DEFAULT(MODNAME, REGISTRATIONSTRING) \
MODNAME * mod = new MODNAME();\
context->addFactory (*mod);\
context->addModule (REGISTRATIONSTRING, *mod)
#define OT_REGISTER_MODULE (MODNAME, VOIDPARAMETER) \
Configurator::addModuleInit(#MODNAME, MODNAME::registerModule, VOIDPARAMETER)
*/
class Context;
#define OT_MODULE(MODNAME) OPENTRACKER_API void registerModule##MODNAME (Context * context, void * data)
#define OT_MODULE_REGISTER_FUNC(MODNAME) \
OPENTRACKER_API void registerModule##MODNAME( Context * context , void * data)
#define OT_MODULE_REGISTRATION_DEFAULT(MODNAME, REGISTRATIONSTRING) \
MODNAME * mod = new MODNAME();\
mod->setContext(context);\
context->addFactory (*mod);\
context->addModule (REGISTRATIONSTRING, *mod)
#define OT_REGISTER_MODULE(MODNAME, VOIDPARAMETER) \
Configurator::addModuleInit(#MODNAME, registerModule##MODNAME, VOIDPARAMETER)
} // namespace ot
#endif
/*
* ------------------------------------------------------------
* End of Module.h
* ------------------------------------------------------------
* Automatic Emacs configuration follows.
* Local Variables:
* mode:c++
* c-basic-offset: 4
* eval: (c-set-offset 'substatement-open 0)
* eval: (c-set-offset 'case-label '+)
* eval: (c-set-offset 'statement 'c-lineup-runin-statements)
* eval: (setq indent-tabs-mode nil)
* End:
* ------------------------------------------------------------
*/
| [
"[email protected]"
] | |
a5fa5889e117e5f7fcb706a194aef97acd741f36 | 4b09ab5e0addcb2f8160e40cb1bf1cae5066d102 | /src/kalman_filter.h | 33632cf5e05b50718cb8945289d15e36a40b2341 | [
"MIT"
] | permissive | jayshah19949596/Extended-Kalman-Filter | 4ab2d13b876aa75bfd09f4af4343abc4bc8ec650 | 0ff22cf78e7547275245088530581427927f393f | refs/heads/master | 2021-04-09T10:24:14.204441 | 2018-04-08T18:36:55 | 2018-04-08T18:36:55 | 125,472,897 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,737 | h | #ifndef KALMAN_FILTER_H_
#define KALMAN_FILTER_H_
#include "Eigen/Dense"
class KalmanFilter {
public:
// state vector
Eigen::VectorXd x_;
// state covariance matrix
Eigen::MatrixXd P_;
// state transition matrix
Eigen::MatrixXd F_;
// process covariance matrix
Eigen::MatrixXd Q_;
// measurement matrix
Eigen::MatrixXd H_;
// measurement covariance matrix
Eigen::MatrixXd R_;
/**
* Constructor
*/
KalmanFilter();
/**
* Destructor
*/
virtual ~KalmanFilter();
/**
* Init Initializes Kalman filter
* @param x_in Initial state
* @param P_in Initial state covariance
* @param F_in Transition matrix
* @param H_in Measurement matrix
* @param R_in Measurement covariance matrix
* @param Q_in Process covariance matrix
*/
void Init(Eigen::VectorXd &x_in, Eigen::MatrixXd &P_in, Eigen::MatrixXd &F_in,
Eigen::MatrixXd &H_in, Eigen::MatrixXd &R_in, Eigen::MatrixXd &Q_in);
/**
* Prediction Predicts the state and the state covariance
* using the process model
* @param delta_T Time between k and k+1 in s
*/
void Predict();
/**
* Updates the state by using standard Kalman Filter equations
* @param z The measurement at k+1
*/
void Update(const Eigen::VectorXd &z);
/**
* Updates the state by using Extended Kalman Filter equations
* @param z The measurement at k+1
*/
void UpdateEKF(const Eigen::VectorXd &z);
/**
* Updates the state by using Extended Kalman Filter equations
* @param z The measurement at k+1
*/
void UpdateCommon(const Eigen::VectorXd& y);
};
#endif /* KALMAN_FILTER_H_ */
| [
"[email protected]"
] |
Subsets and Splits