source string | code_lang string | content string | idx int64 |
|---|---|---|---|
the-stack-v2-dedup | C | #ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <gtk/gtk.h>
#include "callbacks.h"
#include "interface.h"
#include "support.h"
#include"Troupeaux.h"
int BR=1;
int V=0;
void
on_checkbutton1_toggled (GtkToggleButton *togglebutton,
gpointer user_... | 1,330,700 |
the-stack-v2-dedup | C | /**
* @file CheatingHangman.c
* @brief Main class for the cheating hangman game
*
* The program plays hangman with the user with words from a text file.
* The computer is hashing the words every time in groups according to the
* letter given by the user, trying to stall his winning thus making the
* player less likely ... | 1,330,701 |
the-stack-v2-dedup | C | #include <stdio.h>
void PapanPermainan();
void Permainan(int PemainYangBermain,int AIYangBermain);
void BermainBersamaTeman()
{
/*
Deskripsi : Menampilkan jumlah player yang akan bermain
I.S. : User memilih bermain bersama teman
F.S. : Memanggil modul bermain
*/
int JumlahPemain;
gotoxy(45,8); printf("Pi... | 1,330,702 |
the-stack-v2-dedup | C | #ifndef CONSTANTS_H
#define CONSTANTS_H_
// 0 is undefined (default type field value in gameobject)
#define SHIPWRECK 1
#define PLAYER_BULLET 2
#define RUNOTICON 3
#define PLAYER 4
#define MENOTICON 5
#define MENOTICON_BULLET 6
#define SPIKOTICON 7
#endif
| 1,330,703 |
the-stack-v2-dedup | C | #ifndef SYSTEM_H
#define SYSTEM_H
#include <xc.h> // include processor files - each processor file is guarded.
// Accelerometer registers
#define STATUS_REG_AUX 0x07
#define OUT_ADC1_L 0x08
#define OUT_ADC1_H 0x09
#define OUT_ADC2_L 0x0A
#define OUT_ADC2_H 0x0B
#define OUT_ADC3_L ... | 1,330,704 |
the-stack-v2-dedup | C | //
// BAKit_AppKeyDefine.h
// BAQMUIDemo
//
// Created by 博爱 on 2017/3/1.
// Copyright © 2017年 boaihome. All rights reserved.
// 各种第三方 AppKey 的宏定义
#ifndef BAKit_AppKeyDefine_h
#define BAKit_AppKeyDefine_h
#pragma mark - 网易云信
#ifdef DEBUG
#define BAKit_AppKeyDefine_NIM_AppKey @"f8ca029d8448e4728045990a... | 1,330,705 |
the-stack-v2-dedup | C | #include <stdio.h>
#include "buf.h"
int main(void) {
printf("Growable Buffer Demonstration\n");
return 0;
}
| 1,330,706 |
the-stack-v2-dedup | C | #include <linux/module.h>
#include <linux/version.h>
#include <linux/kernel.h>
#include <linux/types.h>
#include <linux/kdev_t.h>
#include <linux/fs.h>
#include <linux/device.h>
#include <linux/cdev.h>
#include <linux/uaccess.h>
#define DEVICE "TELNET_DEVICE"
#define CLASS "TELNET_CLASS"
#define NUMBER 5
static dev_t... | 1,330,707 |
the-stack-v2-dedup | C | #include <lwip/sockets.h>
| 1,330,708 |
the-stack-v2-dedup | C | /*
* node.h
*
* Created on: Nov 11, 2014
* Author: nathan
*/
#ifndef NODE_PT2_H_
#define NODE_PT2_H_
struct cell_pt2{
// Cell Boundaries
double xmin, xmax;
double ymin, ymax;
double xcenter, ycenter;
// Included faces linked list
int numFaces;
double face_x[100];
double face_y[100];
};
#endi... | 1,330,709 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_realloc.c :+: :+: :+: ... | 1,330,710 |
the-stack-v2-dedup | C | #define CHIP "ESP32"
#define _APP_DEBUG_ON_
#define DELETEBEFOREPAIR 0
#define WIFI_CHAN_AP_DEFAULT 0
#define WIFI_PASS_AP_DEFAULT "123456789"
#define FW_REVISON "1.0"
#include <ArduinoJson.h>
//#include <math.h> /* round, floor, ceil, trunc */
| 1,330,711 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* display.c :+: :+: :+: ... | 1,330,712 |
the-stack-v2-dedup | C | /*
* Copyright (c) 1995-1996, by Sun Microsystems, Inc.
* All rights reserved.
*/
#pragma ident "@(#)uppc.c 1.7 96/10/21 SMI"
#include <sys/psm.h>
#include <sys/pit.h>
#define DAKOTA_IACK_PADDR 0xBFFFFFF0
/*
* External References
*/
extern void uppc_setspl();
extern int uppc_intr_enter();
extern void uppc_intr... | 1,330,713 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_print_comb.c :+: :+: :+: ... | 1,330,714 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include "heap.h"
/* mensagem de erro. */
int
erro(const char *str)
{
fprintf(stderr, "%s.\n", str);
return EXIT_FAILURE;
}
/* principal. */
int
main()
{
heap_t *heap = newheap();
heap->A[1] = 3;
heap->A[2] = 7;
heap->A[3] = 14;
heap->A[4] = 9;
heap->A[5] = 19... | 1,330,715 |
the-stack-v2-dedup | C | //
// RSSocket.h
// RSCoreFoundation
//
// Created by RetVal on 11/18/12.
// Copyright (c) 2012 RetVal. All rights reserved.
//
#ifndef RSCoreFoundation_RSSocket_h
#define RSCoreFoundation_RSSocket_h
#include <RSCoreFoundation/RSData.h>
#include <RSCoreFoundation/RSString.h>
#include <RSCoreFoundation/RSRunLoop.h>... | 1,330,716 |
the-stack-v2-dedup | C | #include "rtparse.h"
#include "rtv1.h"
int closest_obj(t_config p, t_init mlx, int x, int y)
{
const t_obj *obj;
t_ray ray;
int obj_id;
t_vect col;
float distance = INFINIT;
float (*pf[7])(t_obj, const t_ray, float *, t_init *) = {ray_sphere, ray_cone_close, ray_cylinder_close, ray_plane, ray_torus, ray_ellip... | 1,330,717 |
the-stack-v2-dedup | C | /*
* Prettyprint_Decorator.h
*
* Created on: Dec 5, 2013
* Author: minhuigu
*/
#ifndef PRETTYPRINT_DECORATOR_H_
#define PRETTYPRINT_DECORATOR_H_
#endif /* PRETTYPRINT_DECORATOR_H_ */
| 1,330,718 |
the-stack-v2-dedup | C | #include <stdio.h>
int foo(int n)
{
n = 2*n;
printf("foo: n=%d ", n);
return n;
}
void main(void)
{
int n=5;
printf("main: foo(n)=%d, n=%d\n", foo(n),n);
}
| 1,330,719 |
the-stack-v2-dedup | C | #include<stdio.h>
int move(int p,char c);
int nextpos(char c);
int main(){
int n,i=0,p=0,m=0;
scanf("%d",&n);
getchar();
for(i=0;i<n;i++){
char name[8];
gets(name);
m=m+move(p,name[0]);
p=nextpos(name[0]);
}
printf("%d",m);
}
int nextpos(char c){
if(c=='A' || ... | 1,330,720 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_memdel.c :+: :+: :+: ... | 1,330,721 |
the-stack-v2-dedup | C | version https://git-lfs.github.com/spec/v1
oid sha256:88449d27972affbb64cc749d6d6dc040bf3d4083cafb220d358e9add40294872
size 17203
| 1,330,722 |
the-stack-v2-dedup | C | /* Classic Ladder Project */
/* Copyright (C) 2001-2021 Marc Le Douarain */
/* http://www.sourceforge.net/projects/classicladder */
/* http://sites.google.com/site/classicladder */
/* May 2012 */
/* ------------------------------------------------------ */
/* Monitor protocol - Transfer files send & receive */
/*... | 1,330,723 |
the-stack-v2-dedup | C | //
// t_zlib.c
// t_zlib
//
// Created by Tal Uliel on 2/7/18.
//
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <zlib.h>
#define ZLIB_PADDING_SIZE (4 * 65536 + 8192) // Empirically determined alloc size for our deflateInit2 call + z_stream
typedef struct {
uint8_t * buf; // pre-... | 1,330,724 |
the-stack-v2-dedup | C | #include "lists.h"
/**
* delete_dnodeint_at_index - deletes a node at a given position of a DDL
* @head: first node
* @index: position of the node to be erased
*
* Return: 1 if succeed, otherwise -1
*/
int delete_dnodeint_at_index(dlistint_t **head, unsigned int index)
{
dlistint_t *current, *node;
unsigned in... | 1,330,725 |
the-stack-v2-dedup | C | /***************************************************************************/
/* */
/* This link grammar system is copyright (C) 1991-1997 by Daniel Sleator */
/* (sleator@cs.cmu.edu) and Davy Temperley. This is work in progress. */
/* ... | 1,330,726 |
the-stack-v2-dedup | C | /******************************************************************************
*
* Copyright(c) 2007 - 2016 Realtek Corporation.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as
* published by the Free Software Founda... | 1,330,727 |
the-stack-v2-dedup | C | #include <stdio.h>
void exercice9()
{
for(int i = 20; i > -1; i--)
{
printf("%d\n", i);
}
} | 1,330,728 |
the-stack-v2-dedup | C | #include <stdio.h>
#define LIM 10
int main(void) {
int mat[LIM][LIM];
int i=0,j=0;
for (i = 0; i < LIM; i++)
for (j = 0; j < LIM; j++)
mat[i][j]=0;
printf("Digite o índice da coluna e o índice da linha: ");
scanf("%d %d", &i, &j);
while((i >= 0) && (j >= 0)) {
printf("Digite o valor da p... | 1,330,729 |
the-stack-v2-dedup | C | // PropertyListViewTest.h
| 1,330,730 |
the-stack-v2-dedup | C | //
// Created by shuhongfan on 2020/10/29.
//
int max(int a,int b){
return a>b?a:b;
} | 1,330,731 |
the-stack-v2-dedup | C | string CSI="\e[";
string *STR=({"$BLK$","$RED$","$GRN$","$YEL$","$BLU$","$MAG$","$CYN$","$WHT$",
"$HIR$","$HIG$","$HIY$","$HIB$","$HIM$","$HIC$","$HIW$",
"$BBLK$","$BRED$","$BGRN$","$BYEL$","$BBLU$","$BMAG$","$BCYN$","$BWHT$",
"$HBRED$","$HBGRN$","$HBYEL$","$HBBLU$","$HBMAG$","$HBCYN$","$HBWHT$",
"$NOR$","$B$","$B... | 1,330,732 |
the-stack-v2-dedup | C | /*
Given a linked list, remove the nth node from the end of list and return its head.
Note:
Given n will always be valid.
Try to do this in one pass.
*/
struct ListNode {
int val;
struct ListNode *next;
};
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
struct ListNode *curr, *fast,... | 1,330,733 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_max.c :+: :+: :+: ... | 1,330,734 |
the-stack-v2-dedup | C | #include <printf.h>
#include <syscall.h>
int main() {
uint64_t rbp;
asm volatile("mov %%rbp, %0\n" : "=m"(rbp)::);
printf("rbp:%lx", rbp);
// Now Write to stdout is identical to write to pipe.
dup2(4, 1);
printf("Hello, world!\n");
int fd = open("/temp.txt", 0);
printf("fd:%d\n", fd);
char buf[30... | 1,330,735 |
the-stack-v2-dedup | C | /*
* File: serialcomm.h
* Author: Corey
*
* Created on March 25, 2013, 2:35 PM
*/
#define BYTECOUNT 0
#define GSHEADER 1
#define DEVICEHEADER 2
#define SENSEHEADER 3
#define SET 'S'
#define GET 'G'
#define DCMOTOR 'M'
#define SENSORS 'S'
#define HEADING 'H'
#define LARM 'A'
#define SERVO 'C'
#define SARM 'D'
#... | 1,330,736 |
the-stack-v2-dedup | C | #include<stdio.h>
int main()
{
char character;
printf("-------------:ALPHABET TESTING:--------------\n");
printf("Enter the ALPHABET BOI:\n");
character = getch();
switch(character)
{
case'a':
printf("The alphabet is VOWEL.");
break;
case'e':
printf("The alphabet is VOWEL.");
break;
case'i': ... | 1,330,737 |
the-stack-v2-dedup | C |
#include "TH1F.h"
TH1F* shifthist( TH1F* hin, double delta = 0.1 ) {
if ( hin == 0x0 ) {
printf("\n\n *** bad input hist: %p\n\n", hin ) ;
return 0x0 ;
}
int nbins = hin -> GetNbinsX() ;
double xlow = hin -> GetXaxis() -> GetBinLowEdge( 1 ) ;
double xhigh = hin -... | 1,330,738 |
the-stack-v2-dedup | C | #include "kmr_04.h"
#include "world/common/SomeMatrixOperations.inc.c"
#define NAMESPACE dup_kmr_04
#include "world/common/CheckPartnerFlags1000.inc.c"
#define NAMESPACE kmr_04
INCLUDE_ASM(s32, "world/area_kmr/kmr_04/8CA960", func_802402C8_8CABC8);
#include "world/common/GetItemName.inc.c"
INCLUDE_ASM(s32, "world/... | 1,330,739 |
the-stack-v2-dedup | C | // This code loops over all of the events in a given root file and makes plots
// It is run as a function analysisSolar.cc+(path/inputFileName.root, path/outputFileName.root)
#include <RAT/DU/DSReader.hh>
#include <RAT/DU/Utility.hh>
#include <RAT/DS/Entry.hh>
#include <RAT/DS/EV.hh>
#include <RAT/DS/Run.hh>
#include <... | 1,330,740 |
the-stack-v2-dedup | C | /*****************************************************************************
* Copyright (c) 2004 : NDS
*
* P R O P R I E T A R Y C O N F I D E N T I A L
*
* The copyright of this document is vested in NDS Ltd. without whose
* prior written permission its contents must not be published,adapted
* or repro... | 1,330,741 |
the-stack-v2-dedup | C | #define DO 261.63
#define DO_S 277.18
#define RE 293.66
#define RE_S 311.13
#define MI 329.63
#define FA 349.23
#define FA_S 369.99
#define SOL 392
#define SOL_S 415.3
#define LA 440.0
#define LA_S 466.0
#define SI 493.88
| 1,330,742 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h> //tiene la funcion random
int main(void) {
for(int x=0;x<10;x++){
printf("valor aleatorio %d\n", rand());
}
return 0;
}
| 1,330,743 |
the-stack-v2-dedup | C | /*
* UAE - The Un*x Amiga Emulator
*
* Save/restore emulator state
*
* (c) 1999-2001 Toni Wilen
*/
#ifndef UAE_SAVESTATE_H
#define UAE_SAVESTATE_H
#include "uae/types.h"
/* functions to save byte,word or long word
* independent of CPU's endianness */
extern void save_store_pos_func (uae_u8 **);
extern... | 1,330,744 |
the-stack-v2-dedup | C | /**
* @file re_sha.h Interface to SHA (Secure Hash Standard) functions
*
* Copyright (C) 2010 Creytiv.com
*/
#ifdef USE_OPENSSL
#include <openssl/sha.h>
#else
/* public api for steve reid's public domain SHA-1 implementation */
/* this file is in the public domain */
/** SHA-1 Context */
typedef struct {
uint... | 1,330,745 |
the-stack-v2-dedup | C | #include "ws2812/light_ws2812.h"
void leds_set(struct cRGB color);
void leds_init();
void leds_off();
void leds_write();
void leds_animate_frame();
void leds_set_animation_mode(uint8_t mode, uint16_t data);
void leds_set_brightness(uint8_t brightness);
void leds_set_mode_random();
void set_animation_color_mode(uint8_t... | 1,330,746 |
the-stack-v2-dedup | C | /**
* @file modem_core_common.h
*
* @brief Common defines for modem_core source
*
* The Clear BSD License
* Copyright Semtech Corporation 2021. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted (subject to the limitations in the d... | 1,330,747 |
the-stack-v2-dedup | C | #include <stdio.h>
//using namespace std;
int main()
{
char s[100],ab;
FILE *f,*g;
//hello howdy
int nl=0;
f=fopen("read.txt","r");
ab;
g=fopen("write.txt","w");
/* while ((a = fgetc(f) )!= EOF)
{
if(a!=' '||a!='\t'||a!='\n')
fprintf(g, "%c", a);
}
*/
fclose(f);
fclose(g);
void fun() {
//Inside F... | 1,330,748 |
the-stack-v2-dedup | C | /**
* user.c
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <assert.h>
#include <string.h>
#include "include/pong.h"
struct User* user_create( int score, char* username, int turn)
{
struct User* _user = malloc(sizeof(struct User));
assert(_user != NULL);
_user->turn = turn;
_user->sco... | 1,330,749 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <signal.h>
#include <arpa/inet.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <unistd.h>
#include <netinet/in.h>
#include <netinet/ip.h>
#include <netinet/ip_icmp.h>
#include <netdb.h>
#include <setjmp.h>
#include <errno.h>
#include <string.h>
#include <linux/if_ether.h>
#include... | 1,330,750 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* parse_specifiers.c :+: :+: :+: ... | 1,330,751 |
the-stack-v2-dedup | C | //tonbaiwei.c
inherit NPC;
inherit F_MASTER;
inherit F_UNIQUE;
void greeting(object);
void init();
void create()
{
set_name("上官云", ({ "shangguan yun","shangguan","yun"}) );
set("gender", "男性" );
set("age", 40);
set("title" , "日月神教白虎堂长老");
set("long", "他长手长脚, 双目精光灿然, 若有威势。\n");
... | 1,330,752 |
the-stack-v2-dedup | C | //
// input.c
// Colorize_Graph
//
// Created by Lidimar on 23/05/19.
// Copyright © 2019 Lidimar. All rights reserved.
//
#include "input.h"
void Flag (int argc, char *argv){
int verbose
opterr = 0;
while((verbose = getopt(argc,arqv,"i:o:")) != -1){
switch (verbose) {
... | 1,330,753 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* btree_apply_by_level.c :+: :+: :+: ... | 1,330,754 |
the-stack-v2-dedup | C | /*
* Copyright (C) 2010-2014 NXP Semiconductors
*
* 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 ... | 1,330,755 |
the-stack-v2-dedup | C | void doWJets()
{
// Test run of chainPlot
cout << "starting" << endl;
TChain *c = new TChain("physics");
c->Add("/phys/groups/tev/scratch4/users/gwatts/GRIDDS/mc12_8TeV.117680.AlpgenPythia_P2011C_WenuNp0.merge.NTUP_COMMON.e1477_s1499_s1504_r3658_r3549_p1575/mc12_8TeV.117680.AlpgenPythia_P2011C_WenuNp0.merge.NTU... | 1,330,756 |
the-stack-v2-dedup | C | #include<stdio.h>
int main()
{
int t,n,max,a[100010],i,count=1;
scanf("%d",&t);
while(t--)
{
max=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(a[i]>max)
max=a[i];
}
printf("Case %d: %d\n",count,max);
count++;
}
return 0;
}
| 1,330,757 |
the-stack-v2-dedup | C | // *****************************************************************************
/*!
\file src/Inciter/Discretization.C
\copyright 2012-2015 J. Bakosi,
2016-2018 Los Alamos National Security, LLC.,
2019 Triad National Security, LLC.
All rights reserved. See the LICENSE fi... | 1,330,758 |
the-stack-v2-dedup | C | #ifndef COORDINADOR_H_
#define COORDINADOR_H_
#define LOG_PATH "../Log.txt"
#include "commons/config.h"
#include "commons/log.h"
typedef struct{
int32_t cant_entradas;
int32_t tam_entradas;
} Dimensiones_Inst;
typedef struct{
char* inst_ID;
int socket;
int entradas_desocupadas;
} Nodo_Instancia;
t_log* log_ope... | 1,330,759 |
the-stack-v2-dedup | C | #ifndef CDRIVER_H
#define CDRIVER_H
#include <linux/cdev.h>
#include <linux/mutex.h>
#ifndef CDRIVER_MAJOR
#define CDRIVER_MAJOR 0
#endif
typedef struct cdriver
{
dev_t dev; //device numbers
struct mutex mut;
struct cdev cdev;
char *buffer;
int data_len;
} cdriver;
//IOC implementation
#defi... | 1,330,760 |
the-stack-v2-dedup | C | #include "mir_runtime.h"
#include "scheduling/mir_sched_pol.h"
#include "mir_worker.h"
#include "mir_task.h"
#include "mir_task_stack.h"
#include "mir_recorder.h"
#include "mir_memory.h"
#include "mir_utils.h"
#include "mir_defines.h"
#include "mir_mem_pol.h"
#include <stdint.h>
#include <stdlib.h>
#include <string.h>... | 1,330,761 |
the-stack-v2-dedup | C | /*
* Copyright (c) 2016-2017 Nicholas Corgan (n.corgan@gmail.com)
*
* Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt
* or copy at http://opensource.org/licenses/MIT)
*/
#ifndef PKSAV_COMMON_TEXT_COMMON_H
#define PKSAV_COMMON_TEXT_COMMON_H
#include <pksav/config.h>
#include <stdlib.h>
... | 1,330,762 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<string.h>
struct employee{
int code;
float salary;
char name[30];
};
// void show(struct emp);
// function in structure
void show(struct employee emp){
printf("The Code of Employee is : %d\n", emp.code);
printf("The Name of Employee is : %s\n", emp.name);
printf("T... | 1,330,763 |
the-stack-v2-dedup | C | #ifndef GUARD_BATTLEANIM_H
#define GUARD_BATTLEANIM_H
#include "sprite.h"
#define REG_BGnCNT_BITFIELD(n) (*(vBgCnt *)REG_ADDR_BG##n##CNT)
#define REG_BG0CNT_BITFIELD REG_BGnCNT_BITFIELD(0)
#define REG_BG1CNT_BITFIELD REG_BGnCNT_BITFIELD(1)
#define REG_BG2CNT_BITFIELD REG_BGnCNT_BITFIELD(2)
#define REG_BG3CNT_BITFIELD... | 1,330,764 |
the-stack-v2-dedup | C | /**
******************************************************************************
* @file : main.h
* @brief : Header for main.c file.
* This file contains the common defines of the application.
******************************************************************************... | 1,330,765 |
the-stack-v2-dedup | C | #include <stdio.h>
int * make_array(int elem, int val);
void show_array(const int * ar, int n);
int main(void)
{
int * pa;
int size;
int value;
puts("Enter the number of element: ");
scanf("%d", &size);
while(size > 0)
{
puts("Enter the initial value: ");
scanf("%d", &valu... | 1,330,766 |
the-stack-v2-dedup | C | /*
* shared lib call functions in main
* $ gcc -shared -fPIC -o liba.so liba.c
*
* main program must link with "-export-dynamic" to export main_func to so
*/
#include <stdio.h>
extern void main_func(void);
void so_func(void)
{
printf("shared lib\n");
main_func();
}
| 1,330,767 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char* argv[]) {
double m = atof(argv[2]);
double n = atof(argv[3]);
float z;
char operator= argv[1][0];
if (operator == '+'){
z=m+n;
printf("%g \n", z);}
else if (operator == '-'){
z=m-n;
printf("%g \n", z);}
e... | 1,330,768 |
the-stack-v2-dedup | C | #define _CRT_SECURE_NO_WARNINGS 1
#include "Heap.h"
//初始化堆
void HeapInit(Heap* hp, HeapDateType* a, size_t n)
{
assert(hp);
hp->_a = (HeapDateType*)malloc(n*sizeof(HeapDateType));
memcpy(hp->_a, a, n*sizeof(HeapDateType));
hp->_size = n;
hp->_capacity = n;
}
//交换
void Swap(HeapDateType *x, HeapDa... | 1,330,769 |
the-stack-v2-dedup | C | /**
*
* MQTT/UDP project
*
* https://github.com/dzavalishin/mqtt_udp
* Copyright (C) 2017-2018 Dmitry Zavalishin, dz@dz.ru
*
*
* Data reception example code
*
**/
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string.h>
#include <stdio.h>
#include <stdl... | 1,330,770 |
the-stack-v2-dedup | C |
inherit ROOM;
void create()
{
set("short", "太湖");
set("long", @LONG
太湖周长六百余里，为长江和钱塘江下游的海湾内湖，又称震
泽、五湖，为江南水网中心。湖中有大小岛屿四十八个，以洞庭西
山和马迹山为最大。湖中烟波浩渺，岛屿浮沉；湖滨丘陵起伏，园
林点缀，构成一幅山外有山，湖中有湖的天然图画。
LONG
);
set("exits", ([ /* sizeof() == 2 */
"east" : __DIR__"taihuzhai",
"northwest" : __DIR__"jiangdao4... | 1,330,771 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_ultimate_div_mod.c :+: :+: :+: ... | 1,330,772 |
the-stack-v2-dedup | C | #ifndef _dimmunix
#define _dimmunix
#define STACKSIZE 1000
#define MAXFRAMES 1
#define MAXPOSITIONS 16384
#define MAXTEMPLATESIZE 4
#define MAXTEMPLATES 1000
#define MAXCYCLESIZE 1000
#define DIMHISTFILE "/data/anr/dimmunix.hist"
#define STATS_PERIOD_SEC 30
/*
int {
false, true
};
*/
struct QueueElem{
void* ... | 1,330,773 |
the-stack-v2-dedup | C | {
//=========Macro generated from canvas: c/The canvas
//========= (Thu Apr 19 18:23:55 2018) by ROOT version5.34/34
TCanvas *c = new TCanvas("c", "The canvas",1,1,920,666);
gStyle->SetOptStat(0);
c->SetHighLightColor(2);
c->Range(0,0,1,1);
c->SetBorderSize(2);
c->SetFrameFillColor(0);
// --------... | 1,330,774 |
the-stack-v2-dedup | C | /* GWBasic statements.h functions implementation */
#include "inc/stmts.h"
/*
Constructor and Destructors
*/
GWBN_Statements* gwbn_NewStatements() {
GWBN_Statements* result = (GWBN_Statements*) malloc (sizeof(GWBN_Statements));
return result;
}
void gwbn_DeleteStatements(GWBN_Statements* ptr) {
free(ptr);
}
... | 1,330,775 |
the-stack-v2-dedup | C | #pragma once
#include <stdint.h>
// System.Collections.Generic.Dictionary`2<UnityEngine.GameObject,System.Int32>
struct Dictionary_2_t935;
// System.Object
#include "mscorlib_System_Object.h"
// System.Collections.Generic.Dictionary`2/ValueCollection<UnityEngine.GameObject,System.Int32>
struct ValueCollection_t3870 ... | 1,330,776 |
the-stack-v2-dedup | C | #ifndef _COMM_INFO_H_
#define _COMM_INFO_H_
/*! \file comm_info.h
* \n
* \brief Comm Info related structure type and function prototypes
* \n
* \n © Copyright 2010-2013 QUALCOMM Technologies Incorporated, All Rights Reserved
*/
/* =======================================================================
... | 1,330,777 |
the-stack-v2-dedup | C | #ifndef __WSJACL_APACHE_MAPPINGS__H_
#define __WSJACL_APACHE_MAPPINGS__H_
#include <apr_network_io.h>
#include <apr_strings.h>
#include <apr_tables.h>
#include <apr_hash.h>
#include <apache_macros.h>
#include <apr_general.h>
#include <apr_pools.h>
#include <apache_typedefs.h>
#include <apr_uri.h>
typedef st... | 1,330,778 |
the-stack-v2-dedup | C | ../../NXOAuth2Client/Sources/OAuth2Client/NXOAuth2FileStreamWrapper.h | 1,330,779 |
the-stack-v2-dedup | C | #define _XOPEN_SOURCE 700
#include "razorbeard.h"
#include "razorbeard_helpers.h"
#include "razorbeard_math.h"
#include "razorbeard_default_widgets.h"
#include "razorbeard_widget_tabs.h"
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
// TODO setters: keyboard shortcuts must implemen... | 1,330,780 |
the-stack-v2-dedup | C | /*
Filename : 08 - functions /08.c
Description : swap , by value
*/
#include<stdio.h>
//declare swap function
void swap(int,int);
int main()
{
//test variables
int x = 10 ,y = 50;
//print value before swap
printf("before x = %d , y= %d \n",x,y);
//swap
swap(x,y);
//print value after swap
prin... | 1,330,781 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* cone.c :+: :+: :+: ... | 1,330,782 |
the-stack-v2-dedup | C | /*! \file Make-Splash/run.h
* \brief Routinen zum erstellen des Splash-bildes
*
* \author Frank Holler
* \date 2013.05
* \copyright GNU Public License.
*/
#ifndef RUN_H
#define RUN_H
#include <windows.h>
#include "splashwin.h"
#include "resource.h"
#include "../share/class/staticlabel.h"
#incl... | 1,330,783 |
the-stack-v2-dedup | C | {
#include "/data/zenith234d/stefan/PhD_work/Useful_Codes/8_Histo/plot_8_plots.C"
// #include "/data/zenith234d/stefan/PhD_work/Useful_Codes/8_Histo/test.C"
#include "/data/zenith234d/stefan/PhD_work/Useful_Codes/Nevents_Histosum/Draw_Errorbar.C"
#include "/data/zenith234d/stefan/PhD_work/Useful_Codes/8_Histo/plot_8_p... | 1,330,784 |
the-stack-v2-dedup | C | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward d... | 1,330,785 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strpaste.c :+: :+: :+: ... | 1,330,786 |
the-stack-v2-dedup | C | /*
* Copyright (c) 2006-2022, RT-Thread Development Team
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2022-08-25 GuEe-GUI first version
*/
#ifndef __OFW_RAW_H__
#define __OFW_RAW_H__
#include <libfdt/libfdt.h>
#define FDT_SIZE_KB 1024
#define FDT_SIZE... | 1,330,787 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<stdlib.h>
void mergesort(int,int);
void merge(int,int,int);
long int inversion_count=0;
long int *el;
void mergesort(int start,int end){
if(start<end){
int mid=(start+end)/2;
mergesort(start,mid);
mergesort(mid+1,end);
merge(start,mid,end);
}
}
void merge(int start,int mid,int end... | 1,330,788 |
the-stack-v2-dedup | C |
typedef struct avlnode {
short height; /* height of avltree (max search levels from node) */
void *data; /* pointer to data of node */
struct avlnode *left, *right; /* pointers to left and right avl subtrees... | 1,330,789 |
the-stack-v2-dedup | C | #include<header.h>
int funcb() {
return 0;
}
| 1,330,790 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdbool.h>
#include <signal.h>
void kill_stop_handler( int num )
{
printf("In SIGINT handler\n");
}
//我们无法为SIGKILL注册信号处理函数
int main(int argc, char **argv)
{
if ( SIG_ERR == signal( SIGKILL, kill_stop_handler)){
printf("registr SIGK... | 1,330,791 |
the-stack-v2-dedup | C | /**
* @file filter.c
* @yzheng
* @mosaic filter
*
* @version 0.1
* @date 2019-03-09
*
* @copyright Copyright (c) 2019, yzheng
*
*/
#include <omp.h>
#include <stdlib.h>
#include "filter.h"
/**
* @Mosaic filter
* divide all pixels into several blocks depend on c
* for each block sum up all pixel values a... | 1,330,792 |
the-stack-v2-dedup | C | /*
* QEMU ICH Emulation
*
* Copyright (c) 2010 Sebastian Herbszt <herbszt@gmx.de>
* Copyright (c) 2010 Alexander Graf <agraf@suse.de>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundat... | 1,330,793 |
the-stack-v2-dedup | C | #include"index.h"
char **g_pp = NULL; //保存指针数组
char filepath[256] = { 0 };
char sortpath[256] = { 0 };
char indexpath[256] = { 0 };
struct index allindex = { 0 }; //索引
int getN() {
FILE *pf = fopen("file.txt", "r");
if (pf == NULL) {
return -1;
}
else {
int i = 0;
while (!feof(pf)) {
... | 1,330,794 |
the-stack-v2-dedup | C | // Copyright 2017 National Technology & Engineering Solutions of Sandia, LLC
// (NTESS), National Renewable Energy Laboratory, University of Texas Austin,
// Northwest Research Associates. Under the terms of Contract DE-NA0003525
// with NTESS, the U.S. Government retains certain rights in this software.
//
// This sof... | 1,330,795 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_st_choice.c :+: :+: :+: ... | 1,330,796 |
the-stack-v2-dedup | C | /* ------------------------------------------------------------------------
*
* rangeset.h
*
* Copyright (c) 2015-2016, Postgres Professional
*
* ------------------------------------------------------------------------
*/
#ifndef PATHMAN_RANGESET_H
#define PATHMAN_RANGESET_H
#include "postgres.h"
#include "no... | 1,330,797 |
the-stack-v2-dedup | C | #include <iostream>
#include <list>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <sys/types.h>
#include <ifaddrs.h>
#include <time.h>
#include "protocol.h"
#include "device... | 1,330,798 |
the-stack-v2-dedup | C | #include "main.h"
void MemTest(int nSize /*KB*/)
{
int nFlag = 0;
char* g_szBuf1;
char* g_szBuf2;
struct timeval timeStart, timeStop;
g_szBuf1 = (char*)malloc(nSize);
g_szBuf2 = (char*)malloc(nSize);
while(1)
{
//开始时间
if(nFlag == 0)
{
gettimeofday(&timeStart, NULL);
nFlag++;
... | 1,330,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.