repo_name stringlengths 6 97 | path stringlengths 3 341 | text stringlengths 8 1.02M |
|---|---|---|
RogerNogue/MVJ_Engine_base | ModuleRender.h | <gh_stars>0
#ifndef __ModuleRender_H__
#define __ModuleRender_H__
#include "Module.h"
#include "MathGeoLib.h"
class ComponentMesh;
class GameObject;
struct SDL_Texture;
struct SDL_Renderer;
struct SDL_Rect;
class ModuleRender : public Module
{
public:
ModuleRender();
~ModuleRender();
bool Init();
update_status... |
RogerNogue/MVJ_Engine_base | ModuleScene.h | <filename>ModuleScene.h
#ifndef __ModuleScene_H__
#define __ModuleScene_H__
#include "Module.h"
#include <vector>
#include "MathGeoLib.h"
class GameObject;
class QuadTreeGnoblin;
class ModuleScene :
public Module
{
public:
ModuleScene();
~ModuleScene();
bool Init()override;
void createGameObject(const char* c);... |
RogerNogue/MVJ_Engine_base | ModuleInput.h | <gh_stars>0
#ifndef __ModuleInput_H__
#define __ModuleInput_H__
#include "Module.h"
typedef unsigned __int8 Uint8;
class ModuleInput : public Module
{
public:
ModuleInput();
~ModuleInput();
bool Init() override;
update_status PreUpdate() override;
bool CleanUp() override;
//vars
int wheelScroll;
const Uin... |
RogerNogue/MVJ_Engine_base | Serializer.h | <filename>Serializer.h
#ifndef __Serializer_H__
#define __Serializer_H__
#include "rapidjson/rapidjson.h"
#include "rapidjson/document.h"
#include "rapidjson/prettywriter.h"
#include "rapidjson/filewritestream.h"
#include "rapidjson/filereadstream.h"
#include "MathGeoLib.h"
class GameObject;
class ComponentMesh;
clas... |
RogerNogue/MVJ_Engine_base | ModuleMenu.h | #ifndef __ModuleMenu_h__
#define __ModuleMenu_h__
#include "Module.h"
#include "imgui.h"
class ModuleMenu :
public Module
{
public:
ModuleMenu();
~ModuleMenu();
bool Init();
update_status PreUpdate() override;
update_status Update() override;
bool CleanUp() override;
void DrawMenu();... |
RogerNogue/MVJ_Engine_base | ModuleCamera.h | #ifndef __ModuleCamera_H__
#define __ModuleCamera_H__
#include "Module.h"
#include "MathGeoLib.h"
class ComponentCamera;
class GameObject;
class ModuleCamera :
public Module
{
public:
ModuleCamera();
~ModuleCamera();
bool Init() override;
update_status Update() override;
void camRotationX(float... |
RogerNogue/MVJ_Engine_base | Application.h | #ifndef __Application_H__
#define __Application_H__
#include<list>
#include "Globals.h"
#include "Module.h"
class ModuleRender;
class ModuleWindow;
class ModuleTextures;
class ModuleInput;
class ModuleProgram;
class ModuleMenu;
class ModuleCamera;
class ModuleModelLoader;
class ModuleTimer;
class ModuleScene;
class M... |
RogerNogue/MVJ_Engine_base | Component.h | <reponame>RogerNogue/MVJ_Engine_base
#ifndef __Component_H__
#define __Component_H__
#include "Globals.h"
class GameObject;
class Component
{
public:
Component(GameObject* dad) { this->dad = dad; };
virtual bool Init() { return true; };
virtual bool CleanUp(){ return true; };
virtual update_status Update() { ... |
RogerNogue/MVJ_Engine_base | ComponentCamera.h | <gh_stars>0
#ifndef __ComponentCamera_H__
#define __ComponentCamera_H__
#include "Component.h"
#include "MathGeoLib.h"
//class for the cameras that are not the editor camera
class JSON_Value;
class ComponentCamera :
public Component
{
public:
ComponentCamera(GameObject* dad);
ComponentCamera(JSON_Value* camFile, Ga... |
RogerNogue/MVJ_Engine_base | Globals.h | #ifndef __Globals_H__
#define __Globals_H__
#include <windows.h>
#include <stdio.h>
#define LOG(format, ...) log(__FILE__, __LINE__, format, __VA_ARGS__);
void log(const char file[], int line, const char* format, ...);
enum update_status{
UPDATE_CONTINUE = 1,
UPDATE_STOP,
UPDATE_ERROR
};
enum component_type{
C... |
RogerNogue/MVJ_Engine_base | GameObject.h | <gh_stars>0
#ifndef __ModuleGameObject_H__
#define __ModuleGameObject_H__
#include "Globals.h"
#include "MathGeoLib/include/Geometry/AABB.h"
#include <vector>
class ComponentMesh;
class ComponentMaterial;
class ComponentCamera;
class ComponentTransform;
class ComponentShape;
class QuadNode;
class JSON_Value;
class Gam... |
RogerNogue/MVJ_Engine_base | ModuleTimer.h | #ifndef __ModuleTimer_H__
#define __ModuleTimer_H__
#include "Module.h"
#include "SDL.h"
class ModuleTimer :
public Module
{
public:
ModuleTimer();
~ModuleTimer();
bool Init() override;
update_status Update() override;
double getRealTime();
double getRealHighPrecisionTime();
//variables
float t... |
RogerNogue/MVJ_Engine_base | ComponentShape.h | #ifndef __ComponentShape_H__
#define __ComponentShape_H__
#include "Component.h"
class JSON_Value;
class par_shapes_mesh;
class ComponentShape :
public Component
{
public:
ComponentShape(GameObject* dad, shape_type type);
ComponentShape(JSON_Value* shapeFile, GameObject* dad);
~ComponentShape();
bool CleanUp()ove... |
RogerNogue/MVJ_Engine_base | ModuleTextures.h | <filename>ModuleTextures.h
#ifndef __ModuleTextures_H__
#define __ModuleTextures_H__
#include<list>
#include "Module.h"
class GameObject;
class ComponentMaterial;
struct SDL_Texture;
class ModuleTextures : public Module
{
public:
ModuleTextures();
~ModuleTextures();
bool Init() override;
unsigned Load(const c... |
RogerNogue/MVJ_Engine_base | QuadNode.h | <reponame>RogerNogue/MVJ_Engine_base
#ifndef __QuadNode_H__
#define __QuadNode_H__
#include "MathGeoLib.h"
#include <vector>
class GameObject;
class QuadNode
{
public:
QuadNode(AABB section, QuadNode* parent, int num);
QuadNode(AABB section);
~QuadNode();
void addNode(GameObject* node);
void deleteObject(GameObjec... |
MSIhub/Vive_SpatialTrackingStudy | 03_DataCollectionAPI/ClientParallel/ClientParallel/src/main.h | #ifndef MAIN_H_
#define MAIN_H_
#pragma once
#include <iostream>
#include <fstream>
#include <string>
#include <WS2tcpip.h>
#include <iomanip>
#include <intrin.h>
#include <exception>
#include <chrono>
#include <Windows.h>
#include <stdio.h>
#include <cstdint>
#include <thread>
#pragma comment(lib, "ws2_32.lib")
#... |
MSIhub/Vive_SpatialTrackingStudy | 02_VLTSandC16ServerSetup/OpenVRServer/ViveTrack/main.h | #pragma once
#undef UNICODE
#define WIN32_LEAN_AND_MEAN
#define FLOAT_PRECISION 8
#define DEFAULT_DELAYSECS 8 // 120Hz sampling , time in milliseconds
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include "LighthouseTracking.h"
#include "cpTime.h"
#include <cstring>
#include <strings... |
MSIhub/Vive_SpatialTrackingStudy | 02_VLTSandC16ServerSetup/OpenVRServer/ViveTrack/TcpServer.h | <reponame>MSIhub/Vive_SpatialTrackingStudy<filename>02_VLTSandC16ServerSetup/OpenVRServer/ViveTrack/TcpServer.h
#ifndef TCPSERVER_H_
#define TCPSERVER_H_
#pragma once
#undef UNICODE
#include <iostream>
#include <WS2tcpip.h>
#include <windows.h>
#include <iomanip>
#include <intrin.h>
#define WIN32_LEAN_AND_MEAN
#d... |
arpnetwork/libarpcap | include/ScreenCapture.h | <gh_stars>1-10
/*
* Copyright 2018 ARP Network
*
* 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 l... |
suesai/muduo | contrib/thrift/ThriftServer.h | #ifndef MUDUO_CONTRIB_THRIFT_THRIFTSERVER_H
#define MUDUO_CONTRIB_THRIFT_THRIFTSERVER_H
#include <map>
#include <boost/bind.hpp>
#include <boost/noncopyable.hpp>
#include "muduo/base/ThreadPool.h"
#include "muduo/net/TcpServer.h"
#include <thrift/server/TServer.h>
#include "contrib/thrift/ThriftConnection.h"
usin... |
peejster/stream_monitor | simplesample_http.c | <reponame>peejster/stream_monitor
// Copyright (c) Microsoft. All rights reserved.
// Licesendnsed under the MIT license. See LICENSE file in the project root for full license information.
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include <pgmspace.h>
/* This sample uses the _LL APIs of ioth... |
danielgindi/FileDir | FileDirController.h | //
// FileDirController.h
// FileDir
//
// Created by <NAME> on 6/24/14.
// Copyright (c) 2013 <NAME>. All rights reserved.
//
// https://github.com/danielgindi/FileDir
//
// The MIT License (MIT)
//
// Copyright (c) 2014 <NAME> (<EMAIL>)
//
// Permission is hereby granted, free of charge, to any p... |
danielgindi/FileDir | FileDir.h | <filename>FileDir.h
//
// FileDir.h
// FileDir
//
// Created by <NAME> on 6/24/14.
// Copyright (c) 2013 <NAME>. All rights reserved.
//
// https://github.com/danielgindi/FileDir
//
// The MIT License (MIT)
//
// Copyright (c) 2014 <NAME> (<EMAIL>)
//
// Permission is hereby granted, free of charge... |
mark7/libsdl_extras_interposer | libsdl_extras.c | <gh_stars>1-10
// Released into the public domain by <NAME> <<EMAIL>>
#ifndef _GNU_SOURCE
#define _GNU_SOURCE
#endif
#include <SDL.h>
#include <dlfcn.h>
#include <stdbool.h>
#include <stdlib.h>
static bool g_enable_fullscreen_toggle;
static bool g_enable_ungrab = true;
static bool g_enable_hdb_colorkey_fix;
static b... |
Yukikamome316/MCSE | msscmp/test.c | <gh_stars>1-10
#include <stdio.h>
#include <wchar.h>
#include "msscmp.hpp"
int main(int argc, char const *argv[]) {
loadMsscmp(L"/home/syoch/work/wiiu/msscmp/vita.msscmp");
// extractLoadedMsscmp();
return 0;
}
|
kingosticks/spotify-mitm-proxy | pyshn/shn.c | <gh_stars>10-100
/* $Id: shn.c 182 2009-03-12 08:21:53Z zagor $ */
/* Shannon: Shannon stream cipher and MAC -- reference implementation */
/*
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR... |
KaiserLancelot/kpkg | include/command.h | #pragma once
#include <string>
#include <vector>
namespace kpkg {
void run_commands(const std::vector<std::string>& commands,
const std::string& cwd);
namespace detail {
std::string calc_command(const std::vector<std::string>& commands,
const std::string& cwd);
} // nam... |
KaiserLancelot/kpkg | include/program.h | #pragma once
#include <cstdint>
#include <string>
#include <vector>
#include "library.h"
namespace kpkg {
class Program {
public:
Program(const std::vector<std::string>& libraries, const std::string& proxy);
[[nodiscard]] bool build_pyftsubset() const { return build_pyftsubset_; }
[[nodiscard]] std::string ... |
KaiserLancelot/kpkg | include/library.h | <filename>include/library.h<gh_stars>1-10
#pragma once
#include <string>
#include <vector>
namespace kpkg {
class Library {
public:
Library() = default;
Library(const std::string& name, const std::string& releases_url,
const std::string& tags_url,
const std::vector<std::string>& dependency, ... |
KaiserLancelot/kpkg | include/downloader.h | #pragma once
#include <string>
#include <aria2/aria2.h>
namespace kpkg {
class HTTPDownloader {
public:
explicit HTTPDownloader(const std::string &proxy = "");
HTTPDownloader(const HTTPDownloader &) = delete;
HTTPDownloader(HTTPDownloader &&) = delete;
HTTPDownloader &operator=(const HTTPDownloader &) = d... |
KaiserLancelot/kpkg | include/http.h | <reponame>KaiserLancelot/kpkg
#pragma once
#include <string>
#include <klib/http.h>
namespace kpkg {
klib::Response http_get(const std::string &url, const std::string &proxy);
} // namespace kpkg
|
KaiserLancelot/kpkg | include/upgrade.h | #pragma once
#include <string>
namespace kpkg {
void upgrade(const std::string &proxy);
} // namespace kpkg
|
KaiserLancelot/kpkg | include/github_info.h | <gh_stars>1-10
#pragma once
#include <optional>
#include <string>
#include <string_view>
#include <vector>
namespace kpkg {
struct Asset {
Asset(std::string_view name, std::string_view url) : name_(name), url_(url) {}
std::string name_;
std::string url_;
};
class ReleaseInfo {
public:
explicit ReleaseInfo... |
KaiserLancelot/kpkg | test/extra_test/error.h | #pragma once
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <string_view>
[[noreturn]] void error(std::string_view msg) {
std::cerr << "error: " << msg << '\n';
std::exit(EXIT_FAILURE);
}
[[noreturn]] void require_fail(std::string_view expr,
std::string_view fil... |
KaiserLancelot/kpkg | include/version.h | <reponame>KaiserLancelot/kpkg<gh_stars>1-10
#pragma once
#include <string>
#define KPKG_VER_MAJOR 0
#define KPKG_VER_MINOR 11
#define KPKG_VER_PATCH 2
#define KPKG_VERSION \
(KPKG_VER_MAJOR * 10000 + KPKG_VER_MINOR * 100 + KPKG_VER_PATCH)
#define KPKG_STRINGIZE2(s) #s
#define KPKG_STRINGIZE(s) KPKG_STRINGIZE2(s... |
alfin3/graph-algorithms | data-structures/queue/queue-test.c | /**
queue-test.c
Tests of a generic queue.
The following command line arguments can be used to customize tests:
queue-test
[0, ulong width) : i s.t. # inserts = 2**i
[0, ulong width) : i s.t. # inserts = 2**i in uchar queue test
[0, 1] : on/off push pop first free uint test
[0, 1] ... |
alfin3/graph-algorithms | utilities-pthread/mergesort-pthread/mergesort-pthread.h | <reponame>alfin3/graph-algorithms<filename>utilities-pthread/mergesort-pthread/mergesort-pthread.h
/**
mergesort-pthread.h
Declarations of accessible functions and macro definitions for optimizing
and running a generic merge sort algorithm with parallel sorting and
parallel merging.
The algorithm prov... |
alfin3/graph-algorithms | utilities/utilities-lim/utilities-lim.h | <gh_stars>0
/**
utilities-lim.h
Numerical limits in addition to limits.h requiring only C89/C99.
*/
#ifndef UTILITIES_LIM_H
#define UTILITIES_LIM_H
#include <limits.h>
/**
Provides the precision number of bits given the maximum value of an integer
from 1 to 2**2040 - 1. The width of an unsigned integer ... |
alfin3/graph-algorithms | graph-algorithms/tsp/tsp-test.c | /**
tsp-test.c
Tests of an exact solution of TSP without vertex revisiting
across i) default, division and multiplication-based hash tables, and ii)
weight types.
The following command line arguments can be used to customize tests:
tsp-test:
- [1, # bits in size_t) : a
- [1, # bits in size_t... |
alfin3/graph-algorithms | graph-algorithms/dijkstra/dijkstra.h | /**
dijkstra.h
Declarations of accessible functions for running Dijkstra's algorithm on
graphs with generic integer vertices, generic non-negative weights and a
hash table parameter.
The hash table parameter specifies a hash table used for in-heap
operations, and enables the optimization of space an... |
alfin3/graph-algorithms | graph-algorithms/prim/prim-test.c | /**
prim-test.c
Tests of Prim's algorithm with a hash table parameter across
i) default, division-based and multiplication-based hash tables, ii)
vertex types, and iii) edge weight types.
The following command line arguments can be used to customize tests:
prim-test:
- [0, ushort width) : n for ... |
alfin3/graph-algorithms | utilities/utilities-alg/utilities-alg.c | <filename>utilities/utilities-alg/utilities-alg.c
/**
utilities-alg.c
Implementations of general algorithms.
*/
#include <stdio.h>
#include <stdlib.h>
#include "utilities-mem.h"
static void *elt_ptr(const void *elts, size_t i, size_t elt_size);
/**
Performs "greater or equal" binary search on an array with... |
alfin3/graph-algorithms | data-structures/queue/queue.h | /**
queue.h
Struct declarations and declarations of accessible functions of a
generic dynamically allocated queue, providing a dynamic set of generic
elements in the fifo queue form.
A distinction is made between an element and an "elt_size block". During
an insertion a contiguous block of size elt_... |
alfin3/graph-algorithms | utilities-pthread/mergesort-pthread/mergesort-pthread.c | <reponame>alfin3/graph-algorithms
/**
mergesort-pthread.c
Functions for optimizing and running a generic merge sort algorithm
with parallel sorting and parallel merging.
The algorithm provides \Theta(n/log^{2}n) theoretical parallelism within
the dynamic multithreading model.
The implementation pr... |
alfin3/graph-algorithms | data-structures/graph/graph-test.c | /**
graph-test.c
Tests of graphs with generic integer vertices and generic contiguous
weights.
The following command line arguments can be used to customize tests:
graph-test
[0, size_t width / 2] : n for 2**n vertices in smallest graph
[0, size_t width / 2] : n for 2**n vertices in largest... |
alfin3/graph-algorithms | utilities/utilities-mod/utilities-mod.c | <reponame>alfin3/graph-algorithms
/**
utilities-mod.c
Utility functions in modular arithmetic. The utility functions are
integer overflow-safe. The provided implementations assume that
the width of size_t is even.
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include "utilities-mod.h"
#i... |
alfin3/graph-algorithms | graph-algorithms/tsp/tsp.h | /**
tsp.h
Declarations of accessible functions for running an exact solution of TSP
without vertex revisiting on graphs with generic weights, including
negative weights, with a hash table parameter.
Vertices are indexed from 0. Edge weights are of any basic type (e.g.
char, int, long, float, double)... |
alfin3/graph-algorithms | graph-algorithms/dijkstra/dijkstra-test.c | /**
dijkstra-test.c
Tests of Dijkstra's algorithm with a hash table parameter across
i) default, division-based and multiplication-based hash tables, ii)
vertex types, and iii) edge weight types.
The following command line arguments can be used to customize tests:
dijkstra-test:
- [0, ushort wid... |
alfin3/graph-algorithms | utilities/utilities-mem/utilities-mem.c | /**
utilities-mem.c
Utility functions for memory management.
*/
#include <stdio.h>
#include <stdlib.h>
static const size_t C_SIZE_ULIMIT = (size_t)-1;
/**
size_t addition and multiplication with wrapped overflow checking.
*/
size_t add_sz_perror(size_t a, size_t b){
if (a > C_SIZE_ULIMIT - b){
perr... |
alfin3/graph-algorithms | data-structures-pthread/ht-divchn-pthread/ht-divchn-pthread-test.c | <filename>data-structures-pthread/ht-divchn-pthread/ht-divchn-pthread-test.c
/**
ht-divchn-pthread-test.c
Tests of a hash table with generic contiguous or non-contiguous keys and
generic contiguous or non-contiguous elements that is concurrently
accessible and modifiable. The implementation is based on a d... |
alfin3/graph-algorithms | data-structures/graph/graph.h | <reponame>alfin3/graph-algorithms<gh_stars>0
/**
graph.h
Struct declarations and declarations of accessible functions for
representing a graph with generic integer vertices and generic
contiguous weights.
Each list in an adjacency list is represented by a dynamically growing
stack. A vertex is of ... |
alfin3/graph-algorithms | graph-algorithms/bfs/test-perf-uint/bfs-test-perf-uint.c | /**
bfs-test-perf-uint.c
Performance test of the BFS algorithm across graphs with only unsigned
int vertices.
The following command line arguments can be used to customize tests:
bfs-test-perf-uint
[0, uint width - 1] : a
[0, uint width - 1] : b s.t. 2**a <= V <= 2**b for rand graph test
... |
alfin3/graph-algorithms | graph-algorithms/dfs/dfs.h | <filename>graph-algorithms/dfs/dfs.h
/**
dfs.h
Declarations of accessible functions for running the DFS algorithm on
graphs with generic integer vertices indexed from 0. A graph may be
unweighted or weighted. In the latter case the weights of the graph are
ignored.
The recursion in DFS is emulated... |
alfin3/graph-algorithms | data-structures/ht-divchn/ht-divchn.h | /**
ht-divchn.h
Struct declarations and declarations of accessible functions of a hash
table with generic contiguous or non-contiguous keys and generic
contiguous or non-contiguous elements.
The implementation is based on a division method for hashing into upto
the number of slots determined by t... |
alfin3/graph-algorithms | graph-algorithms/bfs/bfs.c | <filename>graph-algorithms/bfs/bfs.c
/**
bfs.c
Functions for running the BFS algorithm on graphs with generic integer
vertices indexed from 0. A graph may be unweighted or weighted. In the
latter case the weights of the graph are ignored.
The effective type of every element in the prev array is of the ... |
alfin3/graph-algorithms | data-structures/stack/stack.c | <gh_stars>0
/**
stack.c
Implementation of a generic dynamically allocated stack, providing a
dynamic set of generic elements in the stack form.
A distinction is made between an element and an "elt_size block". During
an insertion a contiguous block of size elt_size ("elt_size block") is
copied into... |
alfin3/graph-algorithms | graph-algorithms/bfs/bfs.h | /**
bfs.h
Declarations of accessible functions for running the BFS algorithm on
graphs with generic integer vertices indexed from 0. A graph may be
unweighted or weighted. In the latter case the weights of the graph are
ignored.
The effective type of every element in the prev array is of the integer... |
alfin3/graph-algorithms | graph-algorithms/prim/prim.c | /**
prim.c
Prim's algorithm on undirected graphs with generic integer vertices,
generic weights (incl. negative) and a hash table parameter.
The hash table parameter specifies a hash table used for in-heap
operations, and enables the optimization of space and time resources
associated with heap oper... |
alfin3/graph-algorithms | data-structures/queue/queue.c | /**
queue.c
Implementation of a generic dynamically allocated queue, providing a
dynamic set of generic elements in the fifo queue form.
A distinction is made between an element and an "elt_size block". During
an insertion a contiguous block of size elt_size ("elt_size block") is
copied into a q... |
alfin3/graph-algorithms | utilities/utilities-mem/utilities-mem.h | /**
utilities-mem.h
Declarations of accessible utility functions for memory management.
*/
#ifndef UTILITIES_MEM_H
#define UTILITIES_MEM_H
#include <stdlib.h>
/**
Addition and multiplication of size_t with wrapped overflow checking.
*/
size_t add_sz_perror(size_t a, size_t b);
size_t mul_sz_perror(size_t... |
alfin3/graph-algorithms | utilities/utilities-mod/utilities-mod-test.c | /**
utilities-mod-test.c
Tests of integer overflow-safe utility functions in modular arithmetic.
The following command line arguments can be used to customize tests:
utilities-mod-test
[0, size_t width) : n for 2**n # trials in tests
[0, 1] : pow_mod, mul_mod, and sum_mod tests on/off
[0... |
alfin3/graph-algorithms | utilities/utilities-alg/utilities-alg-test.c | <gh_stars>0
/**
utilities-alg-test.c
Tests of general algorithm utilities.
The following command line arguments can be used to customize tests:
utilities-alg-test
[0, # bits in size_t) : n for 2^n trials in geq_leq_bsearch tests
[0, # bits in size_t) : a
[0, # bits in size_t) : b s.t. 2^... |
alfin3/graph-algorithms | utilities-pthread/utilities-pthread/utilities-pthread.c | <gh_stars>0
/**
utilities-pthread.c
Utility functions for concurrency, including
1) pthread functions with wrapped error checking, and
2) an implementation of semaphore operations based on 1),
adopted from The Little Book of Semaphores by <NAME>
(Version 2.2.1) with modifications.
*/
#include <unist... |
alfin3/graph-algorithms | data-structures/ht-divchn/ht-divchn.c | /**
ht-divchn.c
A hash table with generic contiguous or non-contiguous keys and generic
contiguous or non-contiguous elements.
The implementation is based on a division method for hashing into upto
the number of slots determined by the largest prime number in the
C_PRIME_PARTS array, representabl... |
alfin3/graph-algorithms | graph-algorithms/dfs/dfs.c | <reponame>alfin3/graph-algorithms
/**
dfs.c
Functions for running the DFS algorithm on graphs with generic integer
vertices indexed from 0. A graph may be unweighted or weighted. In the
latter case the weights of the graph are ignored.
The recursion in DFS is emulated on a dynamically allocated stack d... |
alfin3/graph-algorithms | data-structures/dll/dll.h | <filename>data-structures/dll/dll.h
/**
dll.h
Struct declarations and declarations of accessible functions of a doubly
linked list with cache-efficient allocation of nodes with two type-
generic data blocks. The list is in a circular representation.
Given the circular representation of the list, the he... |
alfin3/graph-algorithms | graph-algorithms/bfs/bfs-test.c | <gh_stars>0
/**
bfs-test.c
Tests of the BFS algorithm across graphs with different integer types
of vertices within the same translation unit.
The following command line arguments can be used to customize tests:
bfs-test
[0, ushort width - 1] : a
[0, ushort width - 1] : b s.t. 2**a <= V <= 2*... |
alfin3/graph-algorithms | utilities-pthread/mergesort-pthread/mergesort-pthread-test.c | <filename>utilities-pthread/mergesort-pthread/mergesort-pthread-test.c
/**
mergesort-pthread-test.c
Optimization and correctness tests of a generic merge sort algorithm with
parallel sorting and parallel merging.
The following command line arguments can be used to customize tests:
mergesort-pthread-tes... |
alfin3/graph-algorithms | data-structures/heap/heap-test.c | /**
heap-test.c
Tests of a (min) heap across i) division- and mutliplication-based hash
tables, ii) contiguous and noncontiguous elements, and iii) basic
priority types.
The following command line arguments can be used to customize tests:
heap-test
[0, size_t width - 1) : i s.t. # inserts = 2... |
alfin3/graph-algorithms | data-structures/ht-muloa/ht-muloa-test.c | /**
ht-muloa-test.c
Tests of a hash table with generic contiguous keys and generic
contiguous and non-contiguous elements.The implementation is based on a
multiplication method for hashing and an open addressing method for
resolving collisions.
The following command line arguments can be used to cus... |
alfin3/graph-algorithms | graph-algorithms/tsp/tsp.c | <filename>graph-algorithms/tsp/tsp.c
/**
tsp.c
An exact solution of TSP without vertex revisiting on graphs with generic
weights, including negative weights, with a hash table parameter.
Vertices are indexed from 0. Edge weights are of any basic type (e.g.
char, int, long, float, double), or are custom... |
alfin3/graph-algorithms | data-structures/stack/stack-test.c | <filename>data-structures/stack/stack-test.c<gh_stars>0
/**
stack-test.c
Tests of a generic stack.
The following command line arguments can be used to customize tests:
stack-test
[0, ulong width) : i s.t. # inserts = 2**i
[0, ulong width) : i s.t. # inserts = 2**i in uchar stack test
[0,... |
be9/mlmvn | lib/learning.h | #pragma once
#include <algorithm>
#include <vector>
#include <cassert>
#include "mvn.h"
namespace klogic {
namespace learning {
template<typename Desired>
struct sample {
typedef Desired desired_type;
cvector input;
Desired desired;
sample(const cv... |
be9/mlmvn | lib/klogic.h | #pragma once
#include <complex>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cassert>
#include <vector>
namespace klogic {
typedef std::complex<double> cmplx;
typedef std::vector<cmplx> cvector;
const double TWOPI = 2 * M_PI;
// nth power of kth complex root of unity
inline cmplx epsilo... |
be9/mlmvn | lib/transforms.h | <filename>lib/transforms.h
#pragma once
#include <algorithm>
#include "klogic.h"
namespace klogic {
namespace learning {
template<typename Desired> struct sample; // Forward declaration
}
////////////////////////////
namespace transform {
// Discrete (one value)
template<in... |
be9/mlmvn | lib/mvn.h | <reponame>be9/mlmvn<gh_stars>1-10
// Single MVN implementation
#pragma once
#include "klogic.h"
namespace klogic {
class mvn {
public:
typedef cmplx desired_type;
// Create mvn in k-valued logic with N inputs.
// This counts for N+1 weights, including bias.
mvn(int k, int N);... |
be9/mlmvn | lib/mlmvn.h | // MLMVN implementation
#pragma once
#include "mvn.h"
namespace klogic {
class mlmvn;
// Separate class for calculating mlmvn output allows to parallelize, but
// is stingy about memory allocation. It uses max. two vectors to support
// computations for networks containing arbitrary number of layers
... |
jwadia/CPP-MachineLearning | src/regression/Regression.h | <reponame>jwadia/CPP-MachineLearning<gh_stars>0
#ifndef __Regression_H_INCLUDED__
#define __Regression_H_INCLUDED__
#include <vector>
#include <iostream>
class Regression {
private:
std::vector<double> x;
std::vector<double> y;
public:
Regression(std::vector<double> xList, std::vector<double> yList);
... |
jwadia/CPP-MachineLearning | src/util/Functions.h | #ifndef __Functions_H_INCLUDED__
#define __Functions_H_INCLUDED__
#include <vector>
#include <iostream>
#include <math.h>
class Functions {
private:
public:
Functions();
double sigmoid(double input);
};
#endif
|
jwadia/CPP-MachineLearning | src/nural-network/NuralNetwork.h | #ifndef __NuralNetwork_H_INCLUDED__
#define __NuralNetwork_H_INCLUDED__
#include <vector>
#include <iostream>
#include <ctime>
#include "../util/Node.h"
#include "../util/Functions.h"
class NuralNetwork {
private:
std::vector<std::vector<Node>> network;
public:
NuralNetwork(std::vector<int> layers);
s... |
jwadia/CPP-MachineLearning | src/util/Node.h | #ifndef __Node_H_INCLUDED__
#define __Node_H_INCLUDED__
#include <vector>
#include <iostream>
class Node {
private:
std::vector<double> weights;
double value = 0;
public:
Node(std::vector<double> w);
std::vector<double> getWeights();
void setValue(double nodeValue);
double getValue();
};
... |
jwadia/CPP-MachineLearning | src/util/Matrix.h | <reponame>jwadia/CPP-MachineLearning
#ifndef __Matrix_H_INCLUDED__
#define __Matrix_H_INCLUDED__
#include <vector>
class Matrix {
private:
std::vector<std::vector<double>> matrix;
std::vector<std::vector<double>> matrix_aug;
double determinant(std::vector<std::vector<double>> matrix);
public:
Matr... |
jwadia/CPP-MachineLearning | src/knn/Knn.h | <reponame>jwadia/CPP-MachineLearning<filename>src/knn/Knn.h
#ifndef __KNN_INCLUDED__
#define __KNN_H_INCLUDED__
#include <vector>
#include <math.h>
class KNN {
private:
std::vector<double> x;
std::vector<double> y;
std::vector<double> label;
int k;
public:
KNN(std::vector<double> xList, std::v... |
Teddy-van-Jerry/LCDF_Expr | Expr5/D_74LS138_SCH/isim/D_74LS138_D_74LS138_sch_tb_isim_beh.exe.sim/work/m_00000000001292768382_1880772334.c | /**********************************************************************/
/* ____ ____ */
/* / /\/ / */
/* /___/ \ / */
/* \ \ \/ ... |
Teddy-van-Jerry/LCDF_Expr | Expr9/MyALU/isim/AddSub4b_AddSub4b_sch_tb_isim_beh.exe.sim/work/m_00000000002934133259_2589900479.c | <reponame>Teddy-van-Jerry/LCDF_Expr
/**********************************************************************/
/* ____ ____ */
/* / /\/ / */
/* /___/ \ / ... |
Teddy-van-Jerry/LCDF_Expr | Expr10/MyLATCHS/isim/MS_FlipFlop_MS_FlipFlop_sch_tb_isim_beh.exe.sim/work/m_00000000000935785449_1666990586.c | <reponame>Teddy-van-Jerry/LCDF_Expr
/**********************************************************************/
/* ____ ____ */
/* / /\/ / */
/* /___/ \ / ... |
Teddy-van-Jerry/LCDF_Expr | Expr11/MyRevCounter/isim/Conter4bRev_sim_isim_beh.exe.sim/work/m_00000000004261765678_3107888780.c | <reponame>Teddy-van-Jerry/LCDF_Expr<filename>Expr11/MyRevCounter/isim/Conter4bRev_sim_isim_beh.exe.sim/work/m_00000000004261765678_3107888780.c
/**********************************************************************/
/* ____ ____ */
/* / /\/ / ... |
jonssa/AirPolutionSensor_ATMega328_GP2Y1010AU0F | src/GP2Y1010AU0F/GP2Y1010AU0F.c | /*
*
* Created on: 2018-01-02
* Autor: <NAME>
* GP2Y1010AU0F.c
*/
#include <avr/io.h>
#include <avr/interrupt.h>
#include <util/delay.h>
#include "GP2Y1010AU0F.h"
#include "../LCD/lcd44780.h"
uint16_t D_min = 1000;
/*!
* init_adc - funkcja inicjalizująca przetwornik ADC
*/
void init_adc()
{
AD... |
jonssa/AirPolutionSensor_ATMega328_GP2Y1010AU0F | src/1Wire/crc8.h | /************************************************************************/
/* */
/* Access Dallas 1-Wire Device with ATMEL AVRs */
/* */
/* ... |
jonssa/AirPolutionSensor_ATMega328_GP2Y1010AU0F | src/1Wire/crc8.c | <reponame>jonssa/AirPolutionSensor_ATMega328_GP2Y1010AU0F
/************************************************************************/
/* */
/* Access Dallas 1-Wire Device with ATMEL AVRs */
/* ... |
jonssa/AirPolutionSensor_ATMega328_GP2Y1010AU0F | src/LCD/lcd44780.c | //-----------------------------------------------------------------------------------------------------------
// *** Obsługa wyświetlaczy alfanumerycznych zgodnych z HD44780 ***
//
// - Sterowanie: tryb 4-bitowy
// - Dowolne przypisanie każdego sygnału sterującego do dowolnego pinu mikrokontroleralcd_wir
// - Praca z p... |
baita00/Lissajous | TestLissajous/resource.h | <reponame>baita00/Lissajous
//{{NO_DEPENDENCIES}}
// Microsoft Developer Studio generated include file.
// Used by TestLissajous.rc
//
#define IDD_ABOUTBOX 100
#define IDR_MAINFRAME 128
#define IDR_TESTLITYPE 129
#define IDD_CMDFORM 130
#define I... |
baita00/Lissajous | TestLissajous/Label.h | <gh_stars>0
#if !defined(AFX_LABEL_H__A4EABEC5_2E8C_11D1_B79F_00805F9ECE10__INCLUDED_)
#define AFX_LABEL_H__A4EABEC5_2E8C_11D1_B79F_00805F9ECE10__INCLUDED_
#if _MSC_VER >= 1000
#pragma once
#endif // _MSC_VER >= 1000
// Label.h : header file
//
/////////////////////////////////////////////////////////////////////////... |
baita00/Lissajous | TestLissajous/TestLissajousView.h | <filename>TestLissajous/TestLissajousView.h
// TestLissajousView.h : interface of the CTestLissajousView class
//
/////////////////////////////////////////////////////////////////////////////
#if !defined(AFX_TESTLISSAJOUSVIEW_H__9D27DFAE_F2FB_4266_83E9_AFD3E89804B1__INCLUDED_)
#define AFX_TESTLISSAJOUSVIEW_H__9D27DFA... |
baita00/Lissajous | TestLissajous/CmdFormView.h | #if !defined(AFX_CMDFORMVIEW_H__6FC95772_CF45_468E_AEBA_CA43D836E359__INCLUDED_)
#define AFX_CMDFORMVIEW_H__6FC95772_CF45_468E_AEBA_CA43D836E359__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
// CmdFormView.h : header file
//
/////////////////////////////////////////////////////////////////////... |
baita00/Lissajous | TestLissajous/TestLissajousDoc.h | // TestLissajousDoc.h : interface of the CTestLissajousDoc class
//
/////////////////////////////////////////////////////////////////////////////
#if !defined(AFX_TESTLISSAJOUSDOC_H__C6FEC400_6A47_47DF_86C7_A54861A1ED9F__INCLUDED_)
#define AFX_TESTLISSAJOUSDOC_H__C6FEC400_6A47_47DF_86C7_A54861A1ED9F__INCLUDED_
#if _M... |
cran/edesign | src/entrp.c | <filename>src/entrp.c
#include "heap.h"
#include "entrp.h"
#include <stdlib.h>
/* #define VERBOSE 1 */
void entrp(double *A,
int *lda,
int *na,
int *nf,
int *ne,
int *ns,
int *S,
double *opt,
int *S_Work,
int *F,
int *E,
int *ind,
int *ind1,
double *As,
int *l... |
cran/edesign | src/init.c |
/*
* This file contains declarations to interface to the edisgn C and Fortran
* functions.
*
*/
#include <R.h>
#include <Rinternals.h>
#include "edesign.h"
#include <R_ext/Rdynload.h>
/* Fortran interface descriptions: */
static R_NativePrimitiveArgType grd_t[18] = {
REALSXP, /* A */
INTSXP, /* LDA... |
cran/edesign | src/heap.c | <gh_stars>1-10
/* #include "stdlib.h" */
/* #include "math.h" */
#include "heap.h"
/*
* #define N 10
* #define M 20
*/
void int_copy(int *dest, int *src, int n)
{
int i;
for(i=0;i<=n-1;i++)
dest[i]=src[i];
}
/*
* element functions:
* init
* copy
* destroy
* print
*/
heap_element_type *heap_elem... |
cran/edesign | src/heap.h | #include <R.h>
#include <Rinternals.h>
typedef struct heap_element{
int n; /* dimension of E and F */
int *F; /* set E */
int *E; /* set F */
double b; /* upper bound */
int ibranc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.