repo_name stringlengths 5 122 | path stringlengths 3 232 | text stringlengths 6 1.05M |
|---|---|---|
langthom/data-structures | sortingAlgorithms/BubbleSort/C/bubble_sort.c | <reponame>langthom/data-structures<filename>sortingAlgorithms/BubbleSort/C/bubble_sort.c
/* Implementation of Bubble sort.
* (C) <NAME>, 2014
*
* Here the bubble sort algorithm is implemented.
* The bubble sort algorithm runs over the passed
* array and swaps two nodes if they are not sorted.
* The main advantage... |
langthom/data-structures | Queue/C/queue.h | /* Header for a Queue of Integers.
* (C) <NAME>, 2014
*
* This header provides functions for operating on
* the data structure "Queue".
* A Queue is basically a double linked list with
* the operations enqueue (adding a new element)
* and dequeue (removing an element).
* This operations follow the rule that if ... |
langthom/data-structures | Heaps/maxHeap/C/max_heap.h | <gh_stars>0
/* MaxHeap
* (C) <NAME>, 2014
*
* This header implements a MaxHeap.
* A MaxHeap is generally a binary tree that
* follows some rules:
* * The value of a node is ALWAYS
* bigger than the value(s) of
* its child(ren).
* * It is not defined if the left
* child of a no... |
langthom/data-structures | Heaps/minHeap/C/main.c | /* Testing module for MinHeap.
* (C) <NAME>, 2014
*
* This module does some testing on a MinHeap.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include "min_heap.h"
int main( int argc, char *argv[] )
{
printf( "*** Initializing new MinHeap ... done.\n" );
printf( "*** Adding ... |
langthom/data-structures | Queue/C/double_linked_list.h | <filename>Queue/C/double_linked_list.h
/* List header.
* (C) 2014, <NAME>
*
* This header contains a datatype for a double linked list
* that contains "Nodes", that itself contains Integer values.
* It provides methods and functions for acting on such lists.
*
* This code is licensed under the BSD3 license.
*/
... |
langthom/data-structures | RedBlackTree/C/node.c | <reponame>langthom/data-structures
/* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 opti... |
langthom/data-structures | sortingAlgorithms/BubbleSort/C/main.c | /* Testing module for bubble sort.
* (C) <NAME>, 2014
*
* This module tests the bubble-sort
* algorithm on a single array.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include "bubble_sort.h"
#define SIZE 10
void printArray( int *array )
{
int i;
printf( "[ " );
for( i ... |
langthom/data-structures | RedBlackTree/C++/RedBlackTree.h | /* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 p... |
langthom/data-structures | AVLTree/C++/node.h | /* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 p... |
langthom/data-structures | AVLTree/C/node.h | <gh_stars>0
/* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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.
... |
langthom/data-structures | Queue/C/main.c | <filename>Queue/C/main.c
/* Testing module for a Queue.
* (C) <NAME>, 2014
*
* This module performs some basic operations
* on a Queue to show its functionality.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "queue.h"
int main( int argc,... |
langthom/data-structures | Stack/C/main.c | <gh_stars>0
/* Testing module for Stack.
* (C) <NAME>, 2014
*
* This module does some testing on the
* data structure Stack.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include "stack.h"
int main( int argc, char *argv[] )
{
printf( "*** Initializing new Stack ... done.\n" );
... |
langthom/data-structures | Lists/SingleLinkedList/C/single_linked_list.c | <reponame>langthom/data-structures<filename>Lists/SingleLinkedList/C/single_linked_list.c
/* SingleLinkedList.c
* (C) 2014, <NAME>
*
* This module implements all the things listes up
* in the header "single_linked_list.h"
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include <stdlib.h... |
langthom/data-structures | Heaps/maxHeap/C/main.c | /* Testing module for MaxHeap.
* (C) <NAME>, 2014
*
* This module does some testing on a MaxHeap.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include "max_heap.h"
int main( int argc, char *argv[] )
{
printf( "*** Initializing new MaxHeap ... done.\n" );
printf( "*** Adding ... |
langthom/data-structures | AVLTree/C++/avl.h | /* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 p... |
langthom/data-structures | BinarySearchTrees/C++/node.h | /* Node of a list.
* (C) <NAME>, 2014
*
* This header contains a class representing a
* single Node of a binary search tree.
*
* This code is licensed under the BSD3 license.
*/
#ifndef node_h___
#define node_h___
#include <iostream>
#include <cstdlib>
using std::cout;
using std::endl;
/* Class representing... |
langthom/data-structures | AVLTree/C/main.c | /* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 p... |
langthom/data-structures | AVLTree/C/avl.c | <reponame>langthom/data-structures<gh_stars>0
/* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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
* (a... |
langthom/data-structures | RedBlackTree/C/redblack.h | /* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 p... |
langthom/data-structures | Stack/C/stack.c | /* Stack
* (C) <NAME>, 2014
*
* This module implements functions and methods
* used for working with a typical Stack data
* structure, explanation can be found in the header.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include <stdlib.h>
#include "stack.h"
//---------------------... |
langthom/data-structures | Lists/SingleLinkedList/C/main.c | <reponame>langthom/data-structures
/* Testing module.
* (C) 2014, <NAME>
*
* This module does some testing on single-linked lists.
* It will add some values, prints the list and lastly
* frees the entire list.
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include <stdlib.h>
#include... |
langthom/data-structures | Stack/C++/stack.h | /* Implementation of a Stack.
* (C) <NAME>, 2014
*
* This header implements a generic Stack.
* A Stack is a data structure that allows
* access only to the most top element, the
* so-called stack pointer, abbreviated as "sp".
*
* This code is licensed under the BSD3 license.
*/
#ifndef stack_h___
#define sta... |
langthom/data-structures | BinarySearchTrees/C/main.c | <reponame>langthom/data-structures
// main.c - test module for a binary search tree
#include <stdlib.h>
#include "binary_search_tree.h"
int main( int argc, char *argv[] )
{
BinTree *tree = malloc( sizeof( BinTree ));
tree->root = newNode( 7 );
insert( tree, 42 );
insert( tree, 4 );
insert... |
langthom/data-structures | sortingAlgorithms/BubbleSort/C++/bubble_sort.h | <gh_stars>0
/* Header for bubble sort.
* (C) <NAME>, 2014
*
* This code is licensed under the BSD3 license.
*/
#ifndef bubble_sort_h___
#define bubble_sort_h___
void bubble_sort( int *array, int size );
#endif // bubble_sort.h
|
langthom/data-structures | RedBlackTree/C/redblack.c | <gh_stars>0
/* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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.
... |
langthom/data-structures | Heaps/minHeap/C++/node.h | /* Node of a Heap.
* (C) <NAME>, 2014
*
* This header implements a generic Node of
* a heap. A Node saves a value and references
* to its children and parent Node (if existant).
*
* This code is licensed under the BSD3 license.
*/
#ifndef node_h___
#define node_h___
#include <iostream>
using namespace std;
... |
langthom/data-structures | Heaps/minHeap/C/min_heap.c | /* Implementation of all functions from "min_heap.h".
* (C) <NAME>, 2014
*
* Here is the implementation. An extensive documentation can be
* found in the header "min_heap.h".
*
* This code is licensed under the BSD3 license.
*/
#include <stdio.h>
#include <stdlib.h>
#include "min_heap.h"
//------------------ ... |
langthom/data-structures | AVLTree/C/avl.h | /* Copyright (c) 2015, <NAME>. All rights reserved.
*
* 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 p... |
langthom/data-structures | BinarySearchTrees/C++/bintree.h | <gh_stars>0
// bintree.h - declarations for a binary search tree
#include "node.h"
class BinTree
{
private:
Node *root;
public:
/* Default constructor for the tree,
* initializes the root to NULL.
*/
BinTree();
/* Destructor, calls a helper method
*... |
langthom/data-structures | Heaps/minHeap/C++/heap.h | <gh_stars>0
/* Implementation of an abstract heap.
* (C) <NAME>, 2014
*
* A heap is principally a binary tree which follows
* the following rules:
* * A node is EVERYTIME bigger or smaller than
* its children. If its bigger or smaller
* depends on the implementation.
* * There is absolu... |
BeeModule/MRDLNA | MRDLNA/Classes/ARC/MRDLNA.h | //
// MRDLNA.h
// MRDLNA
//
// Created by MccRee on 2018/5/4.
//
#import <Foundation/Foundation.h>
#import "CLUPnP.h"
#import "CLUPnPDevice.h"
typedef NS_ENUM(NSUInteger, DLNAStatus) {
DLNAStatusPlay = 1,
DLNAStatusPause,
DLNAStatusStop,
DLNAStatusBuffer,
DLNAStatusError,
};
@protocol DLNADele... |
malithj/compilers | 2_nfa/NFA.h | <reponame>malithj/compilers<filename>2_nfa/NFA.h
#ifndef NFA_H
#define NFA_H
#include <string>
#include <set>
#include <map>
#include <list>
class NFA
{
// Initial state
int initial_state;
// Set of current states
std::set<int> current_states;
// Set of next states
std::set<int> next_states;
// Map of final... |
malithj/compilers | 4_llvm/main.c | float f(int x, float y, int b, float d, float c);
|
malithj/compilers | 1_bubble_sort/bubble_sort_llvm.c | #include <stdio.h>
#define N 10
void bubble_sort(int * a);
void recursive_bubble_sort(int * a);
int r_bubble_sort(int * a, int idx);
int main() {
int a[N] = {11, 34, 22, 67, 46, 12, 89, 34, 56, 10};
int i = 0;
int j = 0;
int tmp = 0;
for (i = 0; i < N; i ++) {
printf("%d ", a[i]);
}
printf("\n");
recursiv... |
malithj/compilers | 3_flex/code.c | <reponame>malithj/compilers<filename>3_flex/code.c<gh_stars>0
/* Main function */
int main( )
{
float m, n;
printf("\nEnter a number: ");
scanf("%f", &m);
// Function call
n = square(m);
printf("\nSquare of the given number %f is %f", m, n);
}
|
malithj/compilers | 2_nfa/InputBuffer.h | <filename>2_nfa/InputBuffer.h
#ifndef INPUT_BUFFER_H
#define INPUT_BUFFER_H
#include <iostream>
#include "NFA.h"
class InputBuffer
{
// Buffer size and maximum lexeme size
static const int BufferSize = 128;
// Input stream
std::istream *stream;
// Buffer for input stream
std::string buffer;
// Pointers in ... |
malithj/compilers | 1_bubble_sort/bubble_sort.c | <filename>1_bubble_sort/bubble_sort.c<gh_stars>0
#include <stdio.h>
#define N 10
void bubble_sort(int * a);
void recursive_bubble_sort(int * a);
int r_bubble_sort(int * a, int idx);
int main() {
int a[N] = {11, 34, 22, 67, 46, 12, 89, 34, 56, 10};
int i = 0;
int j = 0;
int tmp = 0;
for (i = 0; i < N; i ++) {
... |
Pratik32/nmly | nmly.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <dirent.h>
#include <sys/stat.h>
#include <time.h>
#include <wchar.h>
#include <locale.h>
#include "nmly.h"
#include "helper.h"
const char *SINGLE_MSG = "%s\n";
const char *PREVIEW_MSG = "\n%i File(s) to be modified in %i folder(s)";
cons... |
Pratik32/nmly | nmly.h | #ifndef NMLY_H_
#define NMLY_H_
#define BEFORE 0
#define AFTER 1
#define REPLACE 2
#define UPPER 3
#define LOWER 4
#define SWITCH 5
#define REVERSE 6
#define REMOVE 7
/**
* Returns 1 if the specified path is a file, 0 otherwise.
* @param path the path.
* @return 1 if the specified path is a file, 0 ... |
Pratik32/nmly | helper.c | <reponame>Pratik32/nmly<filename>helper.c
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "helper.h"
void substr(char *sub, const char *str, const int start, const int len)
{
memcpy(sub, &str[start], len);
}
void *trim(char *str)
{
size_t length = strlen(str... |
Pratik32/nmly | helper.h | #ifndef HELPER_H_
#define HELPER_H_
#define BUFFER 512
/**
* Copy a portion of the specified string into a new one.
* @param sub the array where the substring will be stored.
* @param str the original string.
* @param start the starting position.
* @param len the number of characters to copy.
*/
void ... |
wguansen/GSAModuleCategory | Example/GSAModuleCategory/GSAppDelegate.h | <reponame>wguansen/GSAModuleCategory<gh_stars>0
//
// GSAppDelegate.h
// GSAModuleCategory
//
// Created by wguansen on 09/18/2019.
// Copyright (c) 2019 wguansen. All rights reserved.
//
@import UIKit;
@interface GSAppDelegate : UIResponder <UIApplicationDelegate>
@property (strong, nonatomic) UIWindow *window;... |
wguansen/GSAModuleCategory | GSAModuleCategory/Classes/CTMediator+GSACategory.h | //
// CTMediator+GSACategory.h
// GSAModuleCategory_Example
//
// Created by admin on 2019/9/18.
// Copyright © 2019 wguansen. All rights reserved.
//
#import <CTMediator/CTMediator.h>
NS_ASSUME_NONNULL_BEGIN
@interface CTMediator (GSACategory)
-(id)getAController;
@end
NS_ASSUME_NONNULL_END
|
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 2-D Diffusion/2-D_Diffusion/main.c | <gh_stars>1-10
#include <stdio.h>
#include<omp.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0;
double y_len = 2.0;
int x_points = 251;
int y_points = 251;
double del_x = x_len/(x_points-1);
double del_y = y_len/(y_points-1);
double x[x_points]... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 1-D Diffusion/1-D_Diffusion/main.c | #include <stdio.h>
#include<omp.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0; // Define x length of domain
int x_points = 101; // Define number of grid points
double del_x = x_len/(x_points-1); // Length of an element
// Define the... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 1-D Burgers Equation/1D_Burgers_Equation/main.c | <gh_stars>1-10
#include <stdio.h>
#include<omp.h>
#include <stdlib.h>
#include<math.h>
int main()
{
double pi = 3.1416;
// Define the domain
double x_len = 2.0 * pi;
int x_points = 1001;
double del_x = x_len/(x_points-1);
double x[x_points];
#pragma omp parallel for
fo... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 1-D Linear Convection/main.c | <filename>1-D Linear Convection/main.c
#include<stdio.h>
#include<omp.h>
int main(){
// Define the domain
float x_len = 2.0; // Length of the domain
int x_points = 101; // Number of points to consider
float del_x = x_len/(x_points-1); // Length of an element
float x[x_points];
#pragma ... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 2-D Laplace Equation/2-D_Laplace_Equation/main.c | <gh_stars>1-10
#include <stdio.h>
#include<omp.h>
#include<math.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0;
double y_len = 1.0;
int x_points = 301;
int y_points = 301;
double del_x = x_len/(x_points-1);
double del_y = y_len/(y_points-1);
... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 2-D Cavity Flow/2-D_Cavity_Flow/main.c | <filename>2-D Cavity Flow/2-D_Cavity_Flow/main.c
#include <stdio.h>
#include<omp.h>
#include<math.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0;
double y_len = 2.0;
int x_points = 151;
int y_points = 151;
double del_x = x_len/(x_points-1);
double d... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 1-D NonLinear Convection/main.c | #include<stdio.h>
#include<omp.h>
int main(){
// Define the domain
double x_len = 2.0; // Length of the domain
int x_points = 10001; // Number of points to consider
double del_x = x_len/(x_points-1); // Length of an element
double x[x_points];
#pragma omp parallel for firstprivate(del_... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | Dynamic_Memory_Allocation/2-D_NonLinear_Convection/2-D_Nonlinear_Convection_Dynamic/main.c | <gh_stars>1-10
#include <stdio.h>
#include<omp.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0;
double y_len = 2.0;
int x_points = 201;
int y_points = 201;
printf("\n The grid is of %d x %d points \n", x_points, y_points);
double del_x = x_len/(x_poin... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | 2-D Linear Convection/2-D_Linear_Convection/main.c | <filename>2-D Linear Convection/2-D_Linear_Convection/main.c<gh_stars>1-10
#include <stdio.h>
#include<omp.h>
#include <stdlib.h>
int main()
{
// Define the domain
double x_len = 2.0;
double y_len = 2.0;
int x_points = 351;
int y_points = 351;
double del_x = x_len/(x_points-1);
... |
soumyasen1809/OpenMP_C_12_steps_to_Navier_Stokes | Dynamic_Memory_Allocation/1-D_Linear_Convection/1-D_Linear_Convection_Dynamic/main.c | #include <stdio.h>
#include<stdlib.h>
#include<omp.h>
int main()
{
// Define the domain
double x_len = 2.0;
int x_points = 100001;
double del_x = x_len/(x_points-1);
double *x;
x = (double*)malloc(x_points*sizeof(double));
for(int i = 0; i < x_points; i++){
*(x+i) = i *... |
Piot/log-c | src/lib/posix/clog.c | #include <clog/clog.h>
char g_clog_temp_str[CLOG_TEMP_STR_SIZE];
|
Piot/log-c | src/include/clog/clog.h | /*---------------------------------------------------------------------------------------------
* Copyright (c) <NAME>. All rights reserved.
* Licensed under the MIT License. See LICENSE in the project root for license information.
*----------------------------------------------------------------------------------... |
Piot/log-c | src/include/clog/console.h | /*---------------------------------------------------------------------------------------------
* Copyright (c) <NAME>. All rights reserved.
* Licensed under the MIT License. See LICENSE in the project root for license information.
*----------------------------------------------------------------------------------... |
VolkovIA/Learning | Chat_Project/Chat_Project/Message.h | <reponame>VolkovIA/Learning
#pragma once
#include <iostream>
#include <string>
using namespace std;
class Message
{
public:
Message();
private:
bool incoming;
string text;
};
|
amirhmoradi/cordova-jsinjection-plugin | src/ios/CDVJsInjection.h | #import <Cordova/CDVPlugin.h>
#import <WebKit/WebKit.h>
#define kManifestLoadedNotification @"kManifestLoadedNotification"
#define kCDVJsInjectionWebViewDidStartLoad @"CDVJsInjectionWebViewDidStartLoad"
#define kCDVJsInjectionWebViewShouldStartLoadWithRequest @"CDVJsInjectionWebViewShouldStartLoadWithRequest"
#define... |
GavinNL/modern_cmake_examples | single_library_with_external_deps/include/math/add.h | <gh_stars>0
#ifndef LIB_ADD_H
#define LIB_ADD_H
namespace math
{
int add( int a, int b );
}
#endif
|
GavinNL/modern_cmake_examples | single_library_with_external_deps/include/math/subtract.h | #ifndef LIB_SUBTRACT_H
#define LIB_SUBTRACT_H
namespace math
{
int subtract( int a, int b );
}
#endif
|
GavinNL/modern_cmake_examples | single_library_with_external_deps/include/math/mult.h | #ifndef LIB_MULT_H
#define LIB_MULT_H
namespace math
{
int mult( int a, int b );
}
#endif
|
pkosko/engine | shell/platform/tizen/channels/platform_channel.h | <reponame>pkosko/engine
// Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_PLATFORM_CHANNEL_H_
#define EMBEDDER_PLATFORM_CHANNEL_H_
#include "flutter/shell/platform/common/cpp/cli... |
pkosko/engine | shell/platform/tizen/tizen_vsync_waiter.h | <reponame>pkosko/engine<gh_stars>0
// Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_TIZEN_VSYNC_WAITER_H_
#define EMBEDDER_TIZEN_VSYNC_WAITER_H_
#include <Ecore.h>
#include <tdm... |
pkosko/engine | shell/platform/tizen/channels/localization_channel.h | <reponame>pkosko/engine
// Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_LOCALIZATION_CHANNEL_H_
#define EMBEDDER_LOCALIZATION_CHANNEL_H_
#include "flutter/shell/platform/embedd... |
pkosko/engine | shell/platform/tizen/tizen_renderer.h | // Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_TIZEN_RENDERER_H
#define EMBEDDER_TIZEN_RENDERER_H
#include <EGL/egl.h>
class TizenRenderer {
public:
struct TizenWindowGeom... |
pkosko/engine | shell/platform/tizen/tizen_embedder_engine.h | // Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Copyright 2013 The Flutter Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_TIZEN_EMBEDDER_ENGINE_H_
#define EMBEDDER_TIZEN_EMBEDDER_ENGINE_H_
#... |
pkosko/engine | shell/platform/common/cpp/geometry.h | // Copyright 2013 The Flutter Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef FLUTTER_SHELL_PLATFORM_COMMON_CPP_GEOMETRY_H_
#define FLUTTER_SHELL_PLATFORM_COMMON_CPP_GEOMETRY_H_
#include <cmath>
namespace flutter {
// A po... |
pkosko/engine | shell/platform/windows/text_input_manager_win32.h | <reponame>pkosko/engine
// Copyright 2013 The Flutter Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef FLUTTER_SHELL_PLATFORM_WINDOWS_TEXT_INPUT_MANAGER_H_
#define FLUTTER_SHELL_PLATFORM_WINDOWS_TEXT_INPUT_MANAGER_H_
#include... |
pkosko/engine | shell/platform/tizen/channels/lifecycle_channel.h | <filename>shell/platform/tizen/channels/lifecycle_channel.h
// Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_LIFECYCLE_CHANNEL_H_
#define EMBEDDER_LIFECYCLE_CHANNEL_H_
#include ... |
pkosko/engine | shell/platform/tizen/channels/key_event_channel.h | // Copyright 2020 Samsung Electronics Co., Ltd. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef EMBEDDER_KEY_EVENT_CHANNEL_H_
#define EMBEDDER_KEY_EVENT_CHANNEL_H_
#include <Ecore_Input.h>
#include "flutter/shell/platform/common/cpp... |
adammichaelwilliams/prisma | server/libs/jwt-native/src/main/resources/jwt_native.h | <reponame>adammichaelwilliams/prisma
#include <stdint.h>
#include <stdlib.h>
typedef struct ProtocolBuffer {
char *error;
uint8_t *data;
uintptr_t data_len;
} ProtocolBuffer;
ProtocolBuffer *create_token(const char *algorithm,
const char *secret,
int64_t... |
adammichaelwilliams/prisma | server/libs/jdbc-native/src/main/resources/jdbc_native.h | #include <stdint.h>
#include <stdlib.h>
typedef struct PsqlConnection PsqlConnection;
typedef struct PsqlPreparedStatement PsqlPreparedStatement;
typedef struct PointerAndError {
const char *error;
const char *pointer;
} PointerAndError;
PsqlConnection *newConnection(const char *url);
PointerAndError *prepareSt... |
appmonster007/llvm-tutorial | samples/cfile.c | <gh_stars>1-10
// #include <iostream>
// #include <string>
// #include <algorithm>
// #include <vector>
// #include <set>
// using namespace std;
#include <stdio.h>
int IMAGINE_DRAGON(){
return 0;
}
int ONE_REPUBLIC(int a, int b){
return a*b*b;
}
int main(int argc, char const* argv[])
{
printf("I ❤️ LLVM... |
appmonster007/llvm-tutorial | src/CustomNewPass/MyNewPass.h | #ifndef LLVM_TRANSFORMS_MY_NEW_PASS_H
#define LLVM_TRANSFORMS_MY_NEW_PASS_H
#include "llvm/IR/PassManager.h"
#include "llvm/IR/Function.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Passes/PassBuilder.h"
#include "llvm/Passes/PassPlugin.h"
namespace llvm {
class MyNewPass : public PassInfoMixin<MyNewPass> ... |
JyotiMitkar55/iOSAppSecurity | AppSecurity/AppSecurity-Bridging-Header.h | <reponame>JyotiMitkar55/iOSAppSecurity<gh_stars>0
//
// AppSecurity-Bridging-Header.h
// AppSecurity
//
#import "SensitiveObjClass.h"
#import "HookingDetection.h"
#import "AES.h"
#import "HashGenerator.h"
#import "RSA.h"
|
JyotiMitkar55/iOSAppSecurity | AppSecurity/Security/Cryptography/AES/AES.h | <reponame>JyotiMitkar55/iOSAppSecurity
#import <Foundation/Foundation.h>
#import <CommonCrypto/CommonCryptor.h>
#import <CommonCrypto/CommonDigest.h>
@interface AES : NSObject
/* AES Encryption and Decryption */
+(NSData *)getAES128EncryptedStringForMessageData:(NSData *)messageData keyData:(NSData *)keyData;
+(NSD... |
JyotiMitkar55/iOSAppSecurity | AppSecurity/SensitiveClass/SensitiveObjClass.h | <filename>AppSecurity/SensitiveClass/SensitiveObjClass.h<gh_stars>0
//
// SensitiveObjClass.h
// AppSecurity
//
#import <Foundation/Foundation.h>
@interface SensitiveObjClass : NSObject
+(NSString *)callCustomClassMethod;
-(NSString *)callInstanceMethodWithLength:(int)length;
@end
|
JyotiMitkar55/iOSAppSecurity | AppSecurity/Security/HookingDetection/HookingDetection.h | <filename>AppSecurity/Security/HookingDetection/HookingDetection.h
//
// HookingObjc.h
//
#import <Foundation/Foundation.h>
#import <UIKit/UIKit.h>
@interface HookingDetection : NSObject
+(BOOL)isDebugged;
+(BOOL)isDylibInjected;
+(BOOL)isClassHookedWithClassList:(NSArray *)classList;
+(BOOL)isSensitiveFunctionHook... |
JyotiMitkar55/iOSAppSecurity | AppSecurity/Security/HashValue/HashGenerator.h | <reponame>JyotiMitkar55/iOSAppSecurity
//
// RequestHelper.h
//
#import <Foundation/Foundation.h>
@interface HashGenerator : NSObject
+(NSString *)getHashValue;
@end
|
FrankIsAtank/ft_render_frame_lib | src/opengl_context/call_opengl_function.h | <reponame>FrankIsAtank/ft_render_frame_lib
#pragma once
// Calls an OpenGL function and checks for errors
// project headers
#include "basegl/opengl_headers.h"
#include "opengl_debug.h"
// standard headers
#include <functional>
#include <optional>
#include <stdexcept>
#include <type_traits>
namespace ft {
namespace... |
FrankIsAtank/ft_render_frame_lib | src/procloop/process_loop.h | <gh_stars>0
#pragma once
// standard headers
#include <future>
#include <memory>
namespace ft {
namespace rf {
// Forward declaration
class render_frame_impl;
namespace procloop {
// Platform-dependent component of this class
class process_loop_impl;
class process_loop final
{
public:
// Constructor
proce... |
FrankIsAtank/ft_render_frame_lib | src/renderframe/renderframeparams.h | #pragma once
// other projects
#include "vector/vector.hpp"
#include "basegl/color.h"
#include "basegl/pixel_format.h"
// standard headers
#include <string>
namespace ft {
namespace rf {
struct t_render_frame_params
{
std::string window_name;
math::vector<int, 2> position = { 0, 0 };
math::vector<int, 2... |
FrankIsAtank/ft_render_frame_lib | src/opengl_context/opengl_debug.h | <gh_stars>0
#pragma once
// project headers
#include "basegl/opengl_headers.h"
#include "basegl/opengl_except.h"
namespace ft {
namespace rf {
namespace context {
class opengl_context;
} // namespace context
namespace debug {
// If in debug build, causes a break
// if glGetError is not GL_NO_ERROR
void asse... |
FrankIsAtank/ft_render_frame_lib | src/renderframe/renderframeimpl_win32.h | #pragma once
// Platform specific component of a render_frame for Windows
// this project
#include "renderframeparams.h"
#include "window_class_win32.h"
#include "opengl_context/opengl_context.h"
// other projects
#include "handle/ressource_handle.hpp"
#include "base/windows_include.h"
// standard headers
#include... |
FrankIsAtank/ft_render_frame_lib | src/opengl_context/make_current.h | <filename>src/opengl_context/make_current.h
#pragma once
// Make an activatable object the currently active one
// When this object is destroyed the previously active object is
// restored as the currently active object
// Acts as a stack
// other projects
#include "handle/ressource_handle.hpp"
// standard headers
... |
FrankIsAtank/ft_render_frame_lib | src/opengl_context/opengl_function.h | <reponame>FrankIsAtank/ft_render_frame_lib
#pragma once
// Loads opengl functions
// project headers
#include "call_opengl_function.h"
#include "basegl/opengl_except.h"
// other headers
#include "error/ft_assert.h"
namespace ft {
namespace rf {
namespace context {
template<class T>
struct opengl_function
{
// ... |
FrankIsAtank/ft_render_frame_lib | src/renderframe/window_class_win32.h | #pragma once
// Handles class registration for Windows windows
// other projects
#include "base/windows_include.h"
// standard headers
#include <functional>
#include <map>
#include <mutex>
#include <optional>
#include <string>
namespace ft {
namespace rf {
class window_class_win32
{
public:
struct t_params {
... |
FrankIsAtank/ft_render_frame_lib | src/renderframe/renderframe_impl.h | #pragma once
// Platform agnostic header for the platform-dependent component
// of render_frame
// other headers
#include "base/platform.h"
#ifdef FT_OS_WINDOWS
#include "renderframeimpl_win32.h"
#else
#error Unsupported platform
#endif
|
FrankIsAtank/ft_render_frame_lib | src/procloop/process_loop_impl_win32.h | <filename>src/procloop/process_loop_impl_win32.h
#pragma once
// ft_base_lib headers
#include "base/platform.h"
#include "base/windows_include.h"
// standard headers
#include <optional>
#include <future>
#ifdef FT_OS_WINDOWS
namespace ft {
namespace rf {
namespace procloop {
class process_loop_impl
{
public:
/... |
FrankIsAtank/ft_render_frame_lib | src/opengl_context/opengl_context.h | <gh_stars>0
#pragma once
// Owns an OpenGL context
// project headers
#include "basegl/color.h"
#include "basegl/pixel_format.h"
#include "make_current.h"
// other headers
#include "thread/lockable.h"
// standard headers
#include <memory>
#include <optional>
#include <stdexcept>
#include <thread>
#include <vector>... |
FrankIsAtank/ft_render_frame_lib | src/renderframe/renderframe.h | #pragma once
// Platform agnostic interface for a window or other render context
#include "renderframeparams.h"
// standard headers
#include <future>
#include <memory>
namespace ft {
namespace rf {
// Forward declaration
namespace context {
class opengl_context;
}
namespace procloop {
class process_loop;
}
... |
FrankIsAtank/ft_render_frame_lib | src/opengl_context/opengl_context_members.h | #pragma once
// Stores members that require OpenGL headers
#include "basegl/opengl_headers.h"
namespace ft {
namespace rf {
namespace context {
struct opengl_context_members
{
HDC device_context;
HGLRC render_context;
}; // struct opengl_context_members
} // namespace context
} // namespace rf
} // ... |
FrankIsAtank/ft_render_frame_lib | src/procloop/process_loop_impl.h | #pragma once
// Platform agnostic header for the platform-dependent component
// of process_loop
// ft_base_lib headers
#include "base/platform.h"
#ifdef FT_OS_WINDOWS
#include "process_loop_impl_win32.h"
#else
#error Unsupported platform
#endif
|
Kepler-Br/Wolfenstein-clone | texture_loader.h | #ifndef TEXTURE_LOADER_H
#define TEXTURE_LOADER_H
#include "texture.h"
#include <zlib.h>
#include <fstream>
#include <regex>
#include <iostream> // DELETEME
class Texture_loader
{
void throw_error(int status, const std::string &path);
std::string get_filename_from_path(const std::string &path);
uint8_t *r... |
Kepler-Br/Wolfenstein-clone | main_loop.h | #ifndef WOLFENSHETIN_MAIN_LOOP_H
#define WOLFENSHETIN_MAIN_LOOP_H
#include "sdl_wrapper.h"
#include <stack>
#include "input_manager.h"
#include "state_base.h"
class Main_loop {
private:
float deltatime;
int max_fps = 15;
bool is_running = false;
std::stack<State_base *> state_stack;
State_base *st... |
Kepler-Br/Wolfenstein-clone | input_manager.h | <reponame>Kepler-Br/Wolfenstein-clone
#ifndef INPUTMANAGER_H
#define INPUTMANAGER_H
#include <map>
#include <SDL2/SDL.h>
#include <glm/vec2.hpp>
class Input_manager
{
private:
// Key state of current frame.
std::map<uint, bool> keyMap;
// Key state of previous frame.
std::map<uint, bool> prevKeyMap;
... |
Kepler-Br/Wolfenstein-clone | texture_holder.h | //
// Created by kepler-br on 6/11/20.
//
#ifndef WOLFENSTEIN_TEXTURE_HOLDER_H
#define WOLFENSTEIN_TEXTURE_HOLDER_H
#include "texture.h"
#include <vector>
#include <map>
#include <stdexcept>
class Texture_holder
{
private:
std::vector<Texture
*> textures;
std::map<std::string, std::pair<Texture*, size_t>... |
Kepler-Br/Wolfenstein-clone | render_thread.h | #ifndef RENDER_THREAD_H
#define RENDER_THREAD_H
#include "player.h"
#include "raycaster.h"
#include "world.h"
#include "sdl_wrapper.h"
#include "framebuffer.h"
#include "texture_holder.h"
#include <condition_variable>
#include <mutex>
#include <atomic>
#include <queue>
enum Render_thread_task_type
{
stop_thread_t... |
Kepler-Br/Wolfenstein-clone | state_game.h | <gh_stars>0
//
// Created by kepler-br on 6/10/20.
//
#ifndef WOLFENSHETIN_STATE_GAME_H
#define WOLFENSHETIN_STATE_GAME_H
#include "main_loop.h"
#include "state_base.h"
#include "sdl_wrapper.h"
#include "world.h"
#include "player.h"
#include "input_manager.h"
#include <SDL2/SDL_image.h>
#include "texture_holder.h"
#... |
Kepler-Br/Wolfenstein-clone | types.h | //
// Created by kepler-br on 6/11/20.
//
#ifndef WOLFENSTEIN_TYPES_H
#define WOLFENSTEIN_TYPES_H
#include <glm/vec3.hpp>
#include <glm/vec2.hpp>
enum Directions {
direction_right = 0,
direction_up,
direction_left,
direction_down
};
struct Sided_texture_ids
{
size_t right;
size_t up;
siz... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.