repo stringlengths 1 152 ⌀ | file stringlengths 14 221 | code stringlengths 501 25k | file_length int64 501 25k | avg_line_length float64 20 99.5 | max_line_length int64 21 134 | extension_type stringclasses 2
values |
|---|---|---|---|---|---|---|
nidhugg | nidhugg-master/tests/litmus/C-tests/DETOUR0726.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_1_r1_1;
atomic_int atom_1_r3_0;
atomic_int atom_1_r6_0;
void *t0(void *arg){
label_1:;
atomic_store_e... | 1,737 | 27.032258 | 68 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/S+PPO196.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 2, memory_order_seq_cst);
ato... | 1,565 | 26.473684 | 73 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/DETOUR0395.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[2];
atomic_int atom_0_r3_2;
atomic_int atom_0_r5_3;
atomic_int atom_1_r5_2;
atomic_int atom_1_r1_1;
void *t0(void *arg){
l... | 2,190 | 29.430556 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/S+PPO015.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[5];
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 2, memory_order_seq_cst);
ato... | 1,807 | 27.25 | 76 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/n2s.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[4];
atomic_int atom_0_r1_1;
atomic_int atom_1_r1_1;
atomic_int atom_0_r2_0;
atomic_int atom_1_r2_0;
void *t0(void *arg){
l... | 2,426 | 25.966667 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/safe499.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[2];
atomic_int atom_0_r1_1;
atomic_int atom_1_r1_2;
atomic_int atom_2_r1_1;
atomic_int atom_2_r3_1;
void *t0(void *arg){
l... | 2,616 | 26.840426 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/S+PPO823.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[4];
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 2, memory_order_seq_cst);
ato... | 1,754 | 26.857143 | 73 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/S+PPO132.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[5];
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 2, memory_order_seq_cst);
ato... | 1,821 | 27.46875 | 73 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/aclwdrr000.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_3_r1_2;
atomic_int atom_3_r3_0;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 1, memo... | 2,055 | 24.382716 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/MP+PPO841.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[2];
atomic_int atom_1_r1_1;
atomic_int atom_1_r8_0;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 1, memo... | 1,691 | 27.2 | 73 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/MOREDETOUR0578.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_1_r3_0;
atomic_int atom_1_r6_0;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 1, memo... | 1,916 | 26 | 68 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/MP0180.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[4];
atomic_int atom_1_r1_1;
atomic_int atom_1_r7_0;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 1, memo... | 1,501 | 25.350877 | 68 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/LB0140.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[4];
atomic_int atom_0_r1_1;
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
int v2_r1 = atomic_load_explicit(&vars[... | 1,574 | 26.155172 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/Z6.4+eieio+po+po.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_1_r3_0;
atomic_int atom_2_r3_0;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 1, memo... | 1,733 | 24.880597 | 68 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/DETOUR0485.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_0_r3_2;
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 2, memo... | 1,657 | 26.633333 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/LB+PPO0395.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[4];
atomic_int atom_0_r1_1;
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
int v2_r1 = atomic_load_explicit(&vars[... | 1,912 | 28.430769 | 69 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/LB+PPO0040.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[5];
atomic_int atom_0_r1_1;
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
int v2_r1 = atomic_load_explicit(&vars[... | 1,928 | 28.676923 | 77 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/LB+PPO0209.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[5];
atomic_int atom_0_r1_1;
atomic_int atom_1_r1_1;
void *t0(void *arg){
label_1:;
int v2_r1 = atomic_load_explicit(&vars[... | 1,970 | 28.41791 | 74 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/MP+PPO301.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[4];
atomic_int atom_1_r1_1;
atomic_int atom_1_r12_0;
void *t0(void *arg){
label_1:;
atomic_store_explicit(&vars[0], 1, mem... | 2,010 | 28.144928 | 70 | c |
nidhugg | nidhugg-master/tests/litmus/C-tests/MP+lwsync+addr-po-fri-rfi.c | /* Copyright (C) 2018 Magnus Lång and Tuan Phong Ngo
* This benchmark is part of SWSC */
#include <assert.h>
#include <stdint.h>
#include <stdatomic.h>
#include <pthread.h>
atomic_int vars[3];
atomic_int atom_1_r1_1;
atomic_int atom_1_r6_0;
atomic_int atom_1_r9_1;
void *t0(void *arg){
label_1:;
atomic_store_e... | 1,971 | 28.432836 | 73 | c |
SCLCP | SCLCP-master/extra/fix_ext_alignment.h | /* -*- c++ -*- ----------------------------------------------------------
LAMMPS - Large-scale Atomic/Molecular Massively Parallel Simulator
https://www.lammps.org/, Sandia National Laboratories
Steve Plimpton, sjplimp@sandia.gov
Copyright (2003) Sandia Corporation. Under the terms of Contract
DE-AC04-... | 1,566 | 24.274194 | 76 | h |
marsupial_optimizer-noetic/include/misc/plan_path_manager.h | marsupial_optimizer-noetic/include/misc/plan_path_manager.h | #ifndef __PATH_MANAGE_H__
#define __PATH_MANAGE_H__
#include <nav_msgs/Path.h>
#include <QTableWidget>
#include <QMessageBox>
#include <tinyxml.h>
#include <memory>
#include <yaml-cpp/yaml.h>
#include <tf/tf.h>
enum WaypointType {
INSPECTION, INTERMEDIATE, SHELTER, RAMP, UNKNOWN
};
class PlanPath:public QTableWi... | 2,200 | 26.860759 | 128 | h |
null | software-main/rp2lp/mutex.h | #ifndef STATIC_MUTEX_H
#define STATIC_MUTEX_H
#include "config.h"
#include "problem.h"
#include "heuristic.h"
BEGIN_HSPS_NAMESPACE
// implementation of h^2 optimised for static mutex
// calculation (i.e., all zero-cost actions)
class StaticMutex : public Heuristic {
s2index pairix;
bool_vec tab;
void comp... | 5,389 | 30.705882 | 75 | h |
null | software-main/rp2lp/tcn.h | #ifndef TCN_H
#define TCN_H
#include "config.h"
#include "numeric_type.h"
#include "graph.h"
#include <cmath>
BEGIN_HSPS_NAMESPACE
class STN : public matrix<double> {
bool _minimal;
bool _consistent;
public:
STN() : matrix<double>(N_TO_D(POS_INF), 0, 0),
_minimal(true), _consistent(true) { };
STN(index... | 1,332 | 25.137255 | 70 | h |
null | software-main/rp2lp/forward.h | #ifndef SEQ_PROGRESSION_STATE_H
#define SEQ_PROGRESSION_STATE_H
#include "config.h"
#include "atomset.h"
#include "resource.h"
#include "cost_table.h"
#include "preprocess.h"
BEGIN_HSPS_NAMESPACE
struct SeqProgTrans : public ProgressionPath, public SequentialTransition
{
SeqProgTrans(index_type a, NTYPE d) : Seque... | 7,743 | 28.784615 | 79 | h |
null | software-main/rp2lp/ptr_table.h | #ifndef PTR_TABLE_H
#define PTR_TABLE_H
#include "config.h"
#include "index_type.h"
BEGIN_HSPS_NAMESPACE
typedef zero_init_pair<void*> ptr_pair;
class ptr_table {
void* _key;
ptr_table* _left;
ptr_table* _right;
ptr_table* _up;
ptr_table* _prev;
ptr_table* _next;
index_type _count;
public:
void* v... | 2,854 | 20.628788 | 66 | h |
null | software-main/rp2lp/lmcut.h | #ifndef LM_CUT_H
#define LM_CUT_H
#include "config.h"
#include "cost_table.h"
BEGIN_HSPS_NAMESPACE
class LMCutBase : public Heuristic {
protected:
const ACF& init_cost;
Stopwatch& stats;
CostTable* table;
void extend_goal_set(const index_set& sgset,
const AnyACF& costs,
bool_vec& ext_goal... | 2,740 | 25.61165 | 76 | h |
null | software-main/rp2lp/config.h |
#ifndef CONFIG_H
#define CONFIG_H
// Select numerical representation:
// Define exactly one of NTYPE_FLOAT and NTYPE_RATIONAL.
// #define NTYPE_FLOAT
#define NTYPE_RATIONAL
// Enable/disable checking for numerical overflow on certain rational
// arithmetic operations (there is some overhead for this, but it does
// ... | 5,981 | 32.606742 | 78 | h |
null | software-main/rp2lp/pdb.h | #ifndef PDB_H
#define PDB_H
#include "config.h"
#include "sas_heuristic.h"
#include "mdd.h"
#include "enumerators.h"
#include "function.h"
#include "bfs.h"
#include "random.h"
#include <queue>
#include <ext/hash_map>
//#include <unordered_map>
#include <functional>
BEGIN_HSPS_NAMESPACE
// StateAbstraction implement... | 14,061 | 26.790514 | 81 | h |
null | software-main/rp2lp/para_reg.h | #ifndef PARA_REGRESSION_STATE_H
#define PARA_REGRESSION_STATE_H
#include "config.h"
#include "atomset.h"
BEGIN_HSPS_NAMESPACE
class ParaRegTrans : public RegressionPath, ParallelTransition {
public:
ParaRegTrans(const index_set& a, const index_set& n, NTYPE d)
: ParallelTransition(a, n, d) { };
virtual int ... | 5,310 | 30.613095 | 78 | h |
null | software-main/rp2lp/search_base.h | #ifndef SEARCH_BASE_H
#define SEARCH_BASE_H
#include "config.h"
#include "search.h"
#include "stats.h"
#include "name.h"
BEGIN_HSPS_NAMESPACE
class SearchResult {
public:
SearchResult() { };
virtual ~SearchResult();
// non-strict lower bound proven (i.e., if any
// solution exists, its cost is at least 'co... | 9,592 | 26.645533 | 74 | h |
null | software-main/rp2lp/reduce.h | #ifndef REDUCE_H
#define REDUCE_H
#include "config.h"
#include "problem.h"
#include "preprocess.h"
#include "search_base.h"
BEGIN_HSPS_NAMESPACE
class Reduce : public Preprocessor {
Statistics& s_stats;
public:
bool_vec deleted;
index_type n_redundant;
index_type n_useless;
Reduce(Instance& ins, Statis... | 667 | 20.548387 | 76 | h |
null | software-main/rp2lp/numeric_type.h | #ifndef NUMERIC_TYPE_H
#define NUMERIC_TYPE_H
#include "config.h"
#include "rational.h"
#include "index_type.h"
#include "rng.h"
#ifdef NTYPE_RATIONAL
#include <iostream>
#include <iomanip>
#define NTYPE HSPS::rational
#define NNTYPE HSPS::rational::XR
#define N_TO_NN(x) x
#define NN_TO_N(x) HSPS::rational(x)
#de... | 9,435 | 26.193084 | 74 | h |
null | software-main/rp2lp/path.h |
#ifndef PATHS_H
#define PATHS_H
#include "sas.h"
#include "plans.h"
BEGIN_HSPS_NAMESPACE
class Segmentation {
index_type l_seq;
index_type n_seg;
graph cn;
// functions mapping between segment starts/ends / sequence elements
// and nodes in the constraint graph
index_type index_sg_start(index_type... | 4,352 | 27.266234 | 78 | h |
null | software-main/rp2lp/preprocess.h | #ifndef PREPROCESS_H
#define PREPROCESS_H
#include "config.h"
#include "problem.h"
#include "mutex.h"
#include "graph.h"
#include "stats.h"
BEGIN_HSPS_NAMESPACE
class Preprocessor {
public:
Instance& instance;
index_vec atom_map;
index_vec action_map;
index_vec inv_map;
protected:
Stopwatch& sta... | 10,617 | 30.885886 | 77 | h |
null | software-main/rp2lp/cost_table.h | #ifndef COST_TABLE_H
#define COST_TABLE_H
#include "config.h"
#include "heuristic.h"
#ifdef BUILD_WITH_BOOSTING
#include "search_base.h"
#include "hashtable.h"
#endif
BEGIN_HSPS_NAMESPACE
void sort2(index_type& i, index_type& j);
void sort3(index_type& i, index_type& j, index_type& l);
class PairIndexFunction : in... | 14,936 | 28.578218 | 79 | h |
null | software-main/rp2lp/example.h | //
// Copyright (c) 2014-2017 Benjamin Kaufmann
//
// This file is part of Clasp. See http://www.cs.uni-potsdam.de/clasp/
//
// 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 restric... | 1,540 | 39.552632 | 79 | h |
null | software-main/rp2lp/temporal.h | #ifndef TEMPORAL_REGRESSION_STATE_H
#define TEMPORAL_REGRESSION_STATE_H
#include "config.h"
#include "search.h"
#include "problem.h"
#include "heuristic.h"
#include "para_reg.h"
#include "resource.h"
BEGIN_HSPS_NAMESPACE
class TemporalRegState : public AtomSet, public State, public StateFactory {
protected:
Heuri... | 7,195 | 32.314815 | 76 | h |
null | software-main/rp2lp/atomset.h | #ifndef ATOM_SET_H
#define ATOM_SET_H
#include "config.h"
#include "search.h"
#include "problem.h"
#include "heuristic.h"
// #include "stats.h"
#include "rng.h"
BEGIN_HSPS_NAMESPACE
// AtomSet is a base class for (almost) all states that consist of (or
// contain) a set of atoms. Mainly implements the split/split_ra... | 2,681 | 24.301887 | 76 | h |
null | software-main/rp2lp/idao.h | #ifndef IDAO_H
#define IDAO_H
#include "config.h"
#include "search_base.h"
#include "hashtable.h"
BEGIN_HSPS_NAMESPACE
class IDAO : public MultiSearchAlgorithm {
protected:
HashTable* solved_tab;
NTYPE current_bound;
count_type iteration_count;
// count_type iteration_limit;
bool cycle_check;
... | 3,133 | 26.734513 | 78 | h |
null | software-main/rp2lp/hypergraph.h | #ifndef HYPERGRAPH_H
#define HYPERGRAPH_H
#include "index_type.h"
BEGIN_HSPS_NAMESPACE
class hypergraph {
index_type _size;
index_set_vec _edges;
index_set_vec _in;
public:
hypergraph();
hypergraph(index_type n);
hypergraph(index_type n, const index_set_vec e);
hypergraph(const hypergraph& h);
~... | 1,218 | 22.901961 | 73 | h |
null | software-main/rp2lp/sas_heuristic.h | #ifndef SAS_HEURISTIC_H
#define SAS_HEURISTIC_H
#include "config.h"
#include "sas.h"
#include "heuristic.h"
#include <queue>
BEGIN_HSPS_NAMESPACE
// SAS heuristic base class
class SASHeuristic {
protected:
int trace_level;
public:
SASHeuristic() : trace_level(Heuristic::default_trace_level) { };
virtual ~... | 8,139 | 25.864686 | 78 | h |
null | software-main/rp2lp/pcc.h | #ifndef PLAN_CONSTRAINT_CALCULUS_H
#define PLAN_CONSTRAINT_CALCULUS_H
#include "config.h"
//#include "problem.h"
#include "exec.h"
#include "base.h"
#include "mutex.h"
#include "stats.h"
#include "preprocess.h"
BEGIN_HSPS_NAMESPACE
/// ppc representation and some basic utils
// A ppc struct represents a Preference ... | 18,932 | 32.628774 | 83 | h |
null | software-main/rp2lp/soft.h | #ifndef SOFT_H
#define SOFT_H
#include "config.h"
#include "problem.h"
#include "heuristic.h"
#include "enumerators.h"
#include "exec.h"
#include "search_base.h"
#include "resource.h"
#include <list>
BEGIN_HSPS_NAMESPACE
class SoftInstance : public Instance {
public:
struct SoftGoal {
const Name* name;
i... | 6,325 | 26.150215 | 76 | h |
null | software-main/rp2lp/bss.h | #ifndef BSS_H
#define BSS_H
#include "config.h"
#include "search_base.h"
#include "nodeset.h"
BEGIN_HSPS_NAMESPACE
struct signature {
NTYPE f;
NTYPE h;
Node* parent;
Transition* op;
signature(NTYPE _f) : f(_f), h(_f), parent(0), op(0) { };
signature(NTYPE _f, NTYPE _h) : f(_f), h(_h), parent(0), op(0) {... | 3,903 | 24.684211 | 73 | h |
null | software-main/rp2lp/ilb.h |
#ifndef ILB_H
#define ILB_H
#include "config.h"
#include "mutex.h"
#include "search.h"
#include "stats.h"
#include "cost_table.h"
#include "lmcut.h"
//#define USE_CACHE
//#define RANDOMIZE
#define CPLEX_INCREMENTAL
#ifdef USE_CACHE
#include <ext/hash_map>
#endif
#ifdef RANDOMIZE
#include "rng.h"
#endif
#ifdef CP... | 24,700 | 28.441001 | 79 | h |
null | software-main/rp2lp/seq_reg.h | #ifndef SEQ_REGRESSION_STATE_H
#define SEQ_REGRESSION_STATE_H
#include "config.h"
#include "atomset.h"
#include "resource.h"
BEGIN_HSPS_NAMESPACE
class SeqRegState : public AtomSetState, public StateFactory {
protected:
const ACF& cost;
// action leading from predecessor
index_type act;
// consumable ... | 5,886 | 32.833333 | 77 | h |
null | software-main/rp2lp/additive.h | #ifndef ADDITIVE_H
#define ADDITIVE_H
#include "config.h"
#include "cost_table.h"
#include "rng.h"
BEGIN_HSPS_NAMESPACE
class AH : public Heuristic {
void max_cost_mset(index_type m, const index_set& g, index_set& s);
void goal_relevant_remaining_actions(const index_set& g,
index_set& a,
bo... | 3,298 | 32.323232 | 77 | h |
null | software-main/rp2lp/collector.h | #ifndef COLLECTOR_H
#define COLLECTOR_H
#include "config.h"
#include "search.h"
#include "problem.h"
BEGIN_HSPS_NAMESPACE
class Collector : public State, public Search, public Plan {
Instance& instance;
State& state;
bool sp;
index_set pre;
index_set nec_del;
index_set pos_del;
index_type max;
... | 1,481 | 23.7 | 60 | h |
null | software-main/rp2lp/cda_hplus_interface.h | #ifndef CDASTAR_HPLUS_INTERFACE
#define CDASTAR_HPLUS_INTERFACE
extern "C" {
// Read PDDL input (domain and problem), create ILB object.
// Note that input files will be read in the order they are
// given; the domain must precede the problem.
void* init(char* files[], int n_files);
// Get number of (groun... | 1,275 | 34.444444 | 70 | h |
null | software-main/rp2lp/heuristic.h | #ifndef HEURISTIC_H
#define HEURISTIC_H
#include "config.h"
#include "problem.h"
// #include "stats.h"
BEGIN_HSPS_NAMESPACE
class ACF {
public:
virtual ~ACF() { };
virtual NTYPE operator()(index_type a) const = 0;
virtual NTYPE min_cost(index_type n) const;
virtual NTYPE max_cost(index_type n) const;
virt... | 13,452 | 29.784897 | 77 | h |
null | software-main/rp2lp/ida.h | #ifndef IDA_TT_H
#define IDA_TT_H
#include "config.h"
#include "search_base.h"
#include "hashtable.h"
BEGIN_HSPS_NAMESPACE
class IDA : public MultiSearchAlgorithm {
HashTable* ttab;
bool cycle_check;
NTYPE current_bound;
// count_type iteration_limit;
count_type iteration_count;
static const... | 1,112 | 23.733333 | 78 | h |
null | software-main/rp2lp/name.h | #ifndef NAME_H
#define NAME_H
#include "config.h"
#include "index_type.h"
#include <string>
#include <iostream>
BEGIN_HSPS_NAMESPACE
class Name {
public:
static const unsigned int NC_DEFAULT = 0;
static const unsigned int NC_INSTANCE = 1;
static const unsigned int NC_DOMAIN = 2;
static const unsigned int NC... | 6,148 | 28.14218 | 79 | h |
null | software-main/rp2lp/enumerators.h | #ifndef ENUMERATORS_H
#define ENUMERATORS_H
#include "config.h"
#include "index_type.h"
BEGIN_HSPS_NAMESPACE
class IterativeEnumerator {
public:
IterativeEnumerator() { };
virtual ~IterativeEnumerator();
virtual bool first() = 0;
virtual bool next() = 0;
};
class RecursiveEnumerator {
protected:
virtua... | 4,194 | 22.176796 | 75 | h |
null | software-main/rp2lp/stats.h | #ifndef STATS_H
#define STATS_H
// To use stats.h/.cc separate from the hsp* code:
// 1. comment out the following line:
#include "config.h"
// 2. uncomment _exactly_one_ of the following options:
// #define RSS_FROM_RUSAGE_MAX
// #define RSS_FROM_PSINFO
// #define RSS_FROM_PROCFS_STAT
// #define RSS_FROM_MALLINFO
/... | 4,502 | 22.952128 | 68 | h |
null | software-main/rp2lp/bb.h | #ifndef BRANCH_AND_BOUND_H
#define BRANCH_AND_BOUND_H
#include "config.h"
#include "search_base.h"
#include "hashtable.h"
BEGIN_HSPS_NAMESPACE
class DFS : public SearchAlgorithm {
protected:
bool cycle_check;
bool store_cost;
NTYPE upper_bound;
HashTable* ttab;
static const count_type T... | 1,210 | 21.425926 | 60 | h |
null | software-main/rp2lp/minimax.h | #ifndef MINIMAX_H
#define MINIMAX_H
#include "config.h"
#include "search_base.h"
#include "heuristic.h"
#include "hashtable.h"
BEGIN_HSPS_NAMESPACE
class MiniMax : public Search {
protected:
Statistics& stats;
index_type depth;
public:
MiniMax(Statistics& s, index_type d);
virtual ~MiniMax();
NTYPE sta... | 1,766 | 21.948052 | 75 | h |
null | software-main/rp2lp/pop.h | #ifndef POP_H
#define POP_H
#include "config.h"
#include "exec.h"
#include "tcn.h"
BEGIN_HSPS_NAMESPACE
class SafePOP {
public:
int trace_level;
struct step {
index_type index;
index_type act;
index_type t_start;
index_type t_end;
step() : index(no_such_index), act(no_such_index),
t_star... | 2,673 | 22.051724 | 69 | h |
null | software-main/rp2lp/pdb_construction.h | #ifndef PDB_CONSTRUCTION_H
#define PDB_CONSTRUCTION_H
#include "config.h"
#include "pdb.h"
BEGIN_HSPS_NAMESPACE
// #define TEST_USE_INCREMENTAL_PDB
// various PDB-based heuristics
class PDBHeuristic : public MaxH {
protected:
SASInstance& instance;
Statistics& stats;
sas_heuristic_vec pdbs;
index_set_... | 13,724 | 27.125 | 79 | h |
null | software-main/rp2lp/htn.h | #ifndef HTN_H
#define HTN_H
#include "config.h"
#include "problem.h"
#include "search.h"
#include "atomset.h"
BEGIN_HSPS_NAMESPACE
class HTNInstance : public Instance {
public:
static bool write_HTN;
struct step {
bool abstract;
index_type index;
step() : abstract(false), index(no_such_index... | 4,077 | 22.709302 | 70 | h |
null | software-main/rp2lp/graph_grammar.h | #ifndef GRAPH_GRAMMAR_H
#define GRAPH_GRAMMAR_H
#include "graph.h"
BEGIN_HSPS_NAMESPACE
struct partial_match : public std::pair<index_type, index_set> {
partial_match() : std::pair<index_type, index_set>() { };
partial_match(const partial_match& m) : std::pair<index_type, index_set>(m) { };
partial_match(index... | 8,546 | 34.911765 | 82 | h |
null | software-main/rp2lp/nodeset.h | #ifndef NODESET_H
#define NODESET_H
#include "config.h"
#include "index_type.h"
#include "search.h"
// #include "stats.h"
#include "name.h"
#include <map>
#include "function.h"
BEGIN_HSPS_NAMESPACE
class Node;
typedef Node* nodep;
typedef lvector<nodep> node_vec;
struct Link {
Node* node;
NTYPE delta;
Link()... | 4,070 | 22.668605 | 80 | h |
null | software-main/rp2lp/itest.h | #ifndef ITEST_H
#define ITEST_H
#include "config.h"
#include "search_base.h"
#include "hashtable.h"
BEGIN_HSPS_NAMESPACE
class ITest : public SearchAlgorithm {
protected:
HashTable& solved_tab;
NTYPE current_bound;
bool cycle_check;
static const count_type TRACE_LEVEL_2_NOTIFY = 100000;
public... | 1,570 | 20.520548 | 71 | h |
null | software-main/rp2lp/ext_state.h | #ifndef EXTENDED_STATE_H
#define EXTENDED_STATE_H
#include "config.h"
#include "exec.h"
#include "forward.h"
#include "base.h"
BEGIN_HSPS_NAMESPACE
class ExtendedExecState : public ExecState {
protected:
// extended state hooks
virtual bool check_extended_applicability
(Instance::Action& a, ExecErrorSet* e... | 1,818 | 28.33871 | 74 | h |
null | software-main/rp2lp/resource.h | #ifndef RESOURCE_STATE_H
#define RESOURCE_STATE_H
#include "config.h"
#include "problem.h"
#include "heuristic.h"
BEGIN_HSPS_NAMESPACE
typedef lvector<Heuristic*> estimator_vec;
class BasicResourceState {
protected:
Instance& instance;
estimator_vec& estimators;
amt_vec amt_consumed;
public:
BasicResou... | 3,010 | 30.364583 | 79 | h |
null | software-main/rp2lp/char_map.h | #ifndef CHAR_MAP_H
#define CHAR_MAP_H
#include "config.h"
#include "index_type.h"
BEGIN_HSPS_NAMESPACE
class char_map {
public:
static const unsigned int _CHAR_COUNT = 256;
private:
char _map[_CHAR_COUNT];
public:
char_map();
char_map(const char in[_CHAR_COUNT]);
void identify(const char _c0, const cha... | 1,440 | 27.254902 | 69 | h |
null | software-main/rp2lp/string_table.h | #ifndef STRING_TABLE_H
#define STRING_TABLE_H
#include "config.h"
#include "index_type.h"
#include "char_map.h"
BEGIN_HSPS_NAMESPACE
typedef lvector<char*> string_vec;
typedef lvector<void*> element_vec;
inline ::std::ostream& operator<<(::std::ostream& s, const string_vec& vec) {
s << '[';
for (index_type k = ... | 2,407 | 29.871795 | 86 | h |
null | software-main/rp2lp/search.h | #ifndef SEARCH_H
#define SEARCH_H
#include "config.h"
#include "index_type.h"
#include "numeric_type.h"
#include "name.h"
BEGIN_HSPS_NAMESPACE
class Search;
class Plan;
class Transition {
protected:
Transition* pre;
public:
Transition() : pre(0) { };
Transition(const Transition& t) : pre(t.pre) { };
virt... | 10,127 | 28.356522 | 79 | h |
null | software-main/rp2lp/rng.h | #ifndef RNG_H
#define RNG_H
#include "config.h"
#include "index_type.h"
BEGIN_HSPS_NAMESPACE
class RNG {
public:
virtual ~RNG() { };
virtual void seed(unsigned long s) = 0;
virtual unsigned long seed_value() = 0;
virtual unsigned long random() = 0;
void seed_with_pid();
void seed_with_time();
unsig... | 1,829 | 26.313433 | 79 | h |
null | software-main/rp2lp/rational.h | #ifndef RATIONAL_H
#define RATIONAL_H
#include "config.h"
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#ifndef LONG_BITS
#define LONG_BITS ilog(LONG_MAX)
#endif
#ifndef RATIONAL_PRINT_MAX_DECIMALS
#define RATIONAL_PRINT_MAX_DECIMALS 9
#endif
BEGIN_HSPS_NAMESPACE
long euclid(long n, long k, long& a, ... | 10,888 | 21.132114 | 79 | h |
null | software-main/rp2lp/random.h | #ifndef RANDOM_H
#define RANDOM_H
#include "config.h"
#include "problem.h"
#include "preprocess.h"
#include "rng.h"
#include <math.h>
BEGIN_HSPS_NAMESPACE
class RandomInstanceName : public Name {
unsigned long id;
unsigned long v_id;
index_type n;
index_type o;
index_type p;
index_type q;
index_type g... | 4,944 | 25.586022 | 76 | h |
null | software-main/rp2lp/simplify.h | #ifndef SIMPLIFY_H
#define SIMPLIFY_H
#include "config.h"
#include "sas.h"
#include "preprocess.h"
#include "pdb.h"
#include "plans.h"
BEGIN_HSPS_NAMESPACE
class Simplifier {
protected:
SASInstance* instance;
Statistics& stats;
// eliminate_determined_variables submethods
void compute_elimination_graph(gr... | 5,071 | 30.899371 | 76 | h |
null | software-main/rp2lp/chopshop.c | #include <stdlib.h>
#include <stdio.h>
#include <string.h>
/* translation options */
#define NO_REPEAT
#define TIME_SCALE 1
/* #define CHECK_AT_START */
#define WRITE_DOT_FILE
/* define max project size */
#define MAX_N_JOBS 20
#define MAX_N_MODES 10
#define MAX_T_RES 10
/* project info (read from .mm file, u... | 11,870 | 25.38 | 80 | c |
null | software-main/rp2lp/logic.h |
#ifndef LOGIC_H
#define LOGIC_H
#include "config.h"
#include "base.h"
BEGIN_HSPS_NAMESPACE
void new_variable_vec(PDDL_Base* base,
index_type n,
PDDL_Base::variable_vec& v);
PDDL_Base::AFormula* new_atomic_formula(PDDL_Base* base,
PDDL_Base::PredicateSymbol* p);
// construct simple formulas
PDD... | 2,115 | 26.480519 | 75 | h |
null | software-main/rp2lp/plans.h | #ifndef PLANS_H
#define PLANS_H
#include "config.h"
#include "problem.h"
#include "exec.h"
#include "search_base.h"
#include <fstream>
BEGIN_HSPS_NAMESPACE
class ActionSequence : public index_vec, public Plan {
public:
ActionSequence() : index_vec(no_such_index, 0) { };
ActionSequence(const index_vec& vec) : i... | 7,257 | 22.718954 | 74 | h |
null | software-main/rp2lp/locals/config.h |
#ifndef CONFIG_H
#define CONFIG_H
// Select numerical representation:
// Define exactly one of NTYPE_FLOAT and NTYPE_RATIONAL.
// #define NTYPE_FLOAT
#define NTYPE_RATIONAL
// Enable/disable checking for numerical overflow on certain rational
// arithmetic operations (there is some overhead for this, but it does
// ... | 5,981 | 32.606742 | 78 | h |
null | Filler-semi-CRF-main/s4/extensions/cauchy/map.h | // Downloaded from https://github.com/swansontec/map-macro
/*
* Copyright (C) 2012 William Swanson
*
* 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 wi... | 2,953 | 39.465753 | 92 | h |
kotekan | kotekan-master/external/fmt/fmt/compile.h | // Formatting library for C++ - experimental format string compilation
//
// Copyright (c) 2012 - present, Victor Zverovich and fmt contributors
// All rights reserved.
//
// For the license information refer to format.h.
#ifndef FMT_COMPILE_H_
#define FMT_COMPILE_H_
#include <vector>
#include "format.h"
FMT_BEGIN_N... | 15,689 | 32.59743 | 80 | h |
kotekan | kotekan-master/external/fmt/fmt/posix.h | // A C++ interface to POSIX functions.
//
// Copyright (c) 2012 - 2016, Victor Zverovich
// All rights reserved.
//
// For the license information refer to format.h.
#ifndef FMT_POSIX_H_
#define FMT_POSIX_H_
#if defined(__MINGW32__) || defined(__CYGWIN__)
// Workaround MinGW bug https://sourceforge.net/p/mingw/bugs/2... | 8,706 | 26.907051 | 79 | h |
kotekan | kotekan-master/external/fmt/fmt/locale.h | // Formatting library for C++ - std::locale support
//
// Copyright (c) 2012 - present, Victor Zverovich
// All rights reserved.
//
// For the license information refer to format.h.
#ifndef FMT_LOCALE_H_
#define FMT_LOCALE_H_
#include <locale>
#include "format.h"
FMT_BEGIN_NAMESPACE
namespace internal {
template <t... | 2,870 | 35.807692 | 80 | h |
kotekan | kotekan-master/external/fmt/fmt/ranges.h | // Formatting library for C++ - experimental range support
//
// Copyright (c) 2012 - present, Victor Zverovich
// All rights reserved.
//
// For the license information refer to format.h.
//
// Copyright (c) 2018 - present, Remotion (Igor Schulz)
// All Rights Reserved
// {fmt} support for ranges, containers and types... | 9,297 | 31.17301 | 80 | h |
kotekan | kotekan-master/external/fmt/fmt/color.h | // Formatting library for C++ - color support
//
// Copyright (c) 2018 - present, Victor Zverovich and fmt contributors
// All rights reserved.
//
// For the license information refer to format.h.
#ifndef FMT_COLOR_H_
#define FMT_COLOR_H_
#include "format.h"
FMT_BEGIN_NAMESPACE
enum class color : uint32_t {
alice... | 22,863 | 38.017065 | 80 | h |
kotekan | kotekan-master/external/fmt/fmt/ostream.h | // Formatting library for C++ - std::ostream support
//
// Copyright (c) 2012 - present, Victor Zverovich
// All rights reserved.
//
// For the license information refer to format.h.
#ifndef FMT_OSTREAM_H_
#define FMT_OSTREAM_H_
#include <ostream>
#include "format.h"
FMT_BEGIN_NAMESPACE
namespace internal {
templat... | 4,263 | 30.124088 | 80 | h |
kotekan | kotekan-master/external/fmt/fmt/printf.h | // Formatting library for C++
//
// Copyright (c) 2012 - 2016, Victor Zverovich
// All rights reserved.
//
// For the license information refer to format.h.
#ifndef FMT_PRINTF_H_
#define FMT_PRINTF_H_
#include <algorithm> // std::fill_n
#include <limits> // std::numeric_limits
#include "ostream.h"
FMT_BEGIN_NA... | 21,945 | 29.650838 | 80 | h |
kotekan | kotekan-master/external/fmt/fmt/safe-duration-cast.h | /*
* For conversion between std::chrono::durations without undefined
* behaviour or erroneous results.
* This is a stripped down version of duration_cast, for inclusion in fmt.
* See https://github.com/pauldreik/safe_duration_cast
*
* Copyright Paul Dreik 2019
*
* This file is licensed under the fmt license, se... | 9,337 | 30.761905 | 80 | h |
kotekan | kotekan-master/lib/dpdk/packet_copy.h | #ifndef PACKET_COPY_H
#define PACKET_COPY_H
#include <assert.h>
#include <emmintrin.h>
#include <inttypes.h>
#include <rte_cycles.h>
#include <rte_eal.h>
#include <rte_ethdev.h>
#include <rte_lcore.h>
#include <rte_mbuf.h>
#include <stdint.h>
#include <stdio.h>
#include <sys/time.h>
#ifdef __cplusplus
extern "C" {
#e... | 8,678 | 33.304348 | 99 | h |
kotekan | kotekan-master/lib/core/metadata.c | #include "metadata.h"
#include "errors.h" // for CHECK_ERROR_F, CHECK_MEM_F
#include <assert.h> // for assert
#include <stdlib.h> // for malloc, free
#include <string.h> // for memset
// *** Metadata object section ***
struct metadataContainer* create_metadata(size_t object_size, struct metadataPool* parent_pool) {... | 4,957 | 31.194805 | 97 | c |
kotekan | kotekan-master/lib/core/buffer.h | /**
* @file
* @brief The core kotekan buffer object for data transfer between stages
* - buffer
* - StageInfo
* - create_buffer
* - delete_buffer
* - zero_frames
* - register_consumer
* - register_producer
* - mark_frame_full
* - mark_frame_empty
* - wait_for_empty_frame
* - wait_for_full_frame
... | 21,595 | 35.979452 | 99 | h |
kotekan | kotekan-master/lib/core/errors.c | #include "errors.h"
#include <signal.h> // for raise, SIGINT
#include <stdarg.h> // for va_end, va_list, va_start
// Default values for log levels.
int _global_log_level = 3;
int __enable_syslog = 1;
const int __max_log_msg_len = 1024;
enum ReturnCode __status_code = CLEAN_EXIT;
char __err_msg[1024] = "not set";
vo... | 1,633 | 23.029412 | 66 | c |
kotekan | kotekan-master/lib/core/metadata.h | /**
* @file
* @brief The kotekan buffer metadata containers and pools.
* Most of these functions are used by buffer.c internally and not
* indented for use outside of the buffer content.
* - metadataContainer
* -- create_metadata
* -- delete_metadata
* -- reset_metadata_object
* -- increment_metadata_ref_count... | 6,576 | 31.399015 | 97 | h |
kotekan | kotekan-master/lib/core/errors.h | #ifndef ERRORS
#define ERRORS
#include <errno.h> // for errno
#include <stdio.h> // for NULL
#include <syslog.h> // for LOG_ERR, LOG_INFO, LOG_WARNING
#ifdef __cplusplus
#include <cerrno>
#endif
enum ReturnCode {
CLEAN_EXIT = 0,
FATAL_ERROR = 1,
TEST_PASSED,
TEST_FAILED,
RETURN_CODE_COUNT,
... | 6,437 | 43.09589 | 100 | h |
kotekan | kotekan-master/lib/hsa/hsaBase.c | #include "hsaBase.h"
#include "hsa/hsa_ext_amd.h" // for hsa_amd_memory_pool_get_info, hsa_amd_memory_pool_t, hsa_am...
#include <sys/mman.h> // for mlock
#define MAX_NUMA 4
hsa_agent_t cpu_agent[MAX_NUMA];
hsa_amd_memory_pool_t host_region[MAX_NUMA];
uint32_t num_numa_nodes;
// Internal healer function.
static hs... | 3,398 | 28.556522 | 98 | c |
kotekan | kotekan-master/lib/hsa/hsaBase.h | #ifndef HSA_KOTEKAN_BASE_H
#define HSA_KOTEKAN_BASE_H
// Check HSA status code
#define HSA_CHECK(hsa_status) \
{ \
if (hsa_status != HSA_STATUS_S... | 1,323 | 32.1 | 100 | h |
kotekan | kotekan-master/lib/utils/output_formating.c |
#include "output_formating.h"
#include <stdlib.h> // for free, malloc
void reorganize_32_to_16_feed_GPU_Correlated_Data(int actual_num_frequencies,
int actual_num_elements, int* correlated_data) {
// data is processed as 32 elements x 32 elements to fit the kerne... | 22,728 | 51.011442 | 100 | c |
kotekan | kotekan-master/lib/utils/output_formating.h | #ifndef OUTPUT_FORMATING
#define OUTPUT_FORMATING
#include "util.h"
#ifdef __cplusplus
extern "C" {
#endif
void reorganize_32_to_16_feed_GPU_Correlated_Data_Interleaved(int actual_num_frequencies,
int actual_num_elements,
... | 2,941 | 49.724138 | 98 | h |
kotekan | kotekan-master/lib/utils/util.c | #include "util.h"
#include <errno.h> // for errno, EEXIST, EINTR
#include <fcntl.h> // for open, O_CREAT, O_EXCL, O_RDONLY, O_WRONLY
#include <stdio.h> // for printf, perror, snprintf, NULL
#include <stdlib.h> // for exit
#include <sys/stat.h> // for mkdir
#include <sys/time.h> // for gettimeofday, timeval
... | 5,306 | 27.379679 | 100 | c |
kotekan | kotekan-master/lib/utils/util.h | #ifndef UTIL_H
#define UTIL_H
#include <stdint.h> // for int64_t, int32_t
#define EVER \
; \
;
#ifndef MAC_OSX
#define MIN(a, b) ... | 1,898 | 29.629032 | 100 | h |
kotekan | kotekan-master/lib/utils/frb_functions.h | #ifndef FRB_FUNCTIONS_H
#define FRB_FUNCTIONS_H
#include <inttypes.h>
#ifdef __cplusplus
extern "C" {
#endif
#pragma pack(push, 1)
struct FRBHeader {
uint32_t protocol_version;
int16_t data_nbytes;
uint16_t fpga_counts_per_sample;
uint64_t fpga0_ns;
uint64_t fpga_count;
uint16_t nbeams;
u... | 808 | 20.289474 | 60 | h |
kotekan | kotekan-master/lib/utils/nt_memset.c |
#include "nt_memset.h"
#include <assert.h> // for assert
#include <immintrin.h> // for _mm256_stream_si256, __m256i, _mm256_set1_epi8
#include <stdint.h> // for uintptr_t, uint8_t
#include <stdlib.h> // for size_t
// TODO In theory this will work with AVX and not require AVX2, check this.
#ifdef __AVX__
//... | 1,409 | 30.333333 | 76 | c |
kotekan | kotekan-master/lib/utils/rfi_functions.h | #ifndef RFI_FUNCTIONS_H
#define RFI_FUNCTIONS_H
#include <inttypes.h>
#ifdef __cplusplus
extern "C" {
#endif
/*
* @struct RFIHeader
* @brief A structure that contains the header attached to each rfiBroadcast packet.
*/
struct __attribute__((packed)) RFIHeader {
/// uint8_t indicating whether or not the SK val... | 1,248 | 30.225 | 98 | h |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.