source string | code_lang string | content string | idx int64 |
|---|---|---|---|
the-stack-v2-dedup | C | Line 69: Protocol Version: R3
Line 77: Protocol Version: R4
Line 86: Protocol Version: R5
Line 96: Protocol Version: R6
Line 106: Protocol Version: R7
Line 117: Protocol Version: R8
Line 128: Protocol Version: R9
Line 139: Protocol Version: R10
Line 150: Protocol Version: R11
Line 170: Protocol Version: UNKNOWN
Line 18... | 1,328,900 |
the-stack-v2-dedup | C | /*
* Output compare / PWM
*
* Pulse the onboard LED.
*/
#define F_CPU 16000000UL
#include <avr/io.h>
#include <util/delay.h>
void config_timer0(void) {
// With timer clock source freq = 16 MHz / 8,
// our PWM frequency (which is the timer rollover
// frequency) is 2 MHz / 256 = 19.5 KHz
//... | 1,328,901 |
the-stack-v2-dedup | C | #ifndef CONFIG_H
#define CONFIG_H
#include <stdbool.h>
typedef unsigned int uint;
// Constants
#define MAX_USERS 18
#define MAX_TOTAL_USERS 100
#define MAX_REAL_TIME 3
#define MAX_LOG_LINES 10000
#define KEY_SHM 547892
#define KEY_MSG 981431
#define QUANTUM 10000
#endif // CONFIG_H
| 1,328,902 |
the-stack-v2-dedup | C | /*
* Copyright (C) 2012 Nick Johnson <nickbjohnson4224 at gmail.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDE... | 1,328,903 |
the-stack-v2-dedup | C | void benford(Int_t nrEvents=10000000) {
TRandom3 *r1=new TRandom3();
TH1D *h1=new TH1D("h1","TRandom",120,0,12);
TH1D *h2=new TH1D("h1","TRandom",120,0,12);
for (Int_t i=0; i<nrEvents; i++) {
double choice = 10.0*abs(r1->Exp(1));
if (choice > 10.0) choice=choice/10.0;
while (choice < 1.0) {
choice =... | 1,328,904 |
the-stack-v2-dedup | C | /*** Copyright (c), The Regents of the University of California ***
*** For more information please refer to files in the COPYRIGHT directory ***/
/*
This routine is called to set up the tables needed by
chlGeneralQuery.
A series of sTable calls are made to define the table names. When
the 2nd ar... | 1,328,905 |
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,328,906 |
the-stack-v2-dedup | C | /*
* roldan.h
*
* Created on: 16 abr. 2021
* Author: Usuario
*/
#ifndef ROLDAN_H_
#define ROLDAN_H_
/** \brief Menu a mostrar que obtiene la opcion elegida por el usuario.
*
* \return Retorna la opcion seleccionada.
*
*/
int menu();
/** \bri... | 1,328,907 |
the-stack-v2-dedup | C | #include <stdio.h>
int main(void){
int i;
double v[7];
for (i = 0; i < 7; i++)
v[i] = 0.0;
for (i = 0; i < 7; i++)
printf("v[%d] = %.2f\n",i,v[i]);
return 0;
}
| 1,328,908 |
the-stack-v2-dedup | C | void hM1_13()
{
//=========Macro generated from canvas: c/The canvas
//========= (Sat Jun 16 02:49:13 2018) by ROOT version 6.12/06
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,328,909 |
the-stack-v2-dedup | C | #include <string.h>
#include <util/delay.h>
#include "chronodot.h"
#include "i2c.h"
// interpret binary-coded-decimal for two-digit numbers
#define BCD2INT(b) ((((b) & 0xF0) >> 4) * 10 + ((b) & 0x0F))
#define INT2BCD(i) ((((i) / 10) << 4) | ((i) % 10))
#define CTL_REG 0x0E
#define STATUS_REG 0x0F
#define CONV 5
#defi... | 1,328,910 |
the-stack-v2-dedup | C | ddouble_t sqrt_q(ddouble_t x) // max error ratio about 5.8e-33
{
ddouble_t y, y2, v1, v2, v3;
if (x.hi < 0.)
return Q_NAN;
// Start from double precision sqrt
y = ddouble(sqrt(x.hi));
// Use Halley's method to refine
// y -= 2y * (y^2 - x) / (3y^2 + x)
y2 = mul_qq(y, y);
v1 = mul_qd_simple(y, 2.);
v2 = su... | 1,328,911 |
the-stack-v2-dedup | C | /*
* atsc3_bandwidth_statistics.c
*
* Created on: Feb 6, 2019
* Author: jjustman
*/
#include "atsc3_bandwidth_statistics.h"
void *printBandwidthStatistics(void *vargp)
{
__BW_TRACE("Starting printBandwidthStatistics");
setlocale(LC_ALL,"");
struct timeval time_now;
while(true) {
gettimeofday(&g... | 1,328,912 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <string.h>
void reverse(char s[], int left, int right){
if(left >= right)
return;
void swap(char s[], int i, int j);
swap(s, left, right);
left++;
right--;
reverse(s, left, right);
}
void swap(char s[], int i, int j){
int temp = s[i];
s[i] = s[... | 1,328,913 |
the-stack-v2-dedup | C | const vertex_t vertices2[] =
{ // position[xyz], normal[xyz], uv[xy]
{ 32626, 40183, 58531, 62, 164, 230, 141, 64 },
{ 33503, 40148, 58824, 128, 159, 250, 128, 65 },
{ 32745, 40396, 58332, 110, 251, 152, 141, 59 },
{ 33503, 40148, 58824, 128, 159, 250, 128, 65 },
{ 34402, 40169, 58521, 193, 161, 231, 113... | 1,328,914 |
the-stack-v2-dedup | C | version https://git-lfs.github.com/spec/v1
oid sha256:a765939025dd2a6a88e36a0c22d9353c4ebdbee27b8540b451d2f7d67ab65a3a
size 10036
| 1,328,915 |
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,328,916 |
the-stack-v2-dedup | C | #ifndef BITMAP_H
#define BITMAP_H
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
/*************************
Bitmap Structures
*************************/
struct RGB_STCT{
uint8_t R; /* Red componnent */
uint8_t G; /* Green componnent */
uint8_t B; /* Blue componne... | 1,328,917 |
the-stack-v2-dedup | C | // 2016 Adam Jesionowski
#ifndef INC_HEAP_H_
#define INC_HEAP_H_
#include <stdbool.h>
#include <stdint.h>
#ifndef u32
typedef uint32_t u32;
#endif
typedef struct {
u32 Size;
u32* Array;
u32 EndIndex;
} Heap_t;
Heap_t* MakeHeap(u32 size);
bool HeapPeek(Heap_t* heap, u32* value);
bool HeapPush(Heap_t* heap, u3... | 1,328,918 |
the-stack-v2-dedup | C | /*
<fit.c> -- Code to parse and perform various line fitting.
24aug92 jm Original code modified from Numerical Recipes.
16sep92 jm Modified to permit assignment of fit to
individual user variables.
26jul93 jm Added Gaussian fit.
09aug93 jm Removed sscan calls in favor of wipisnumber().
29aug94 jm Remov... | 1,328,919 |
the-stack-v2-dedup | C | /****************************************************************************************/
/* Author : John Atia Nafady */
/* Date : 9 OCT 2020 */
/* Version : V01 */
/* */
/* */
/***********************************************... | 1,328,920 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<math.h>
// Keithís Sheet Music needs a program to implement its music teacherís discount policy.
// The program is to prompt the user to enter the purchase total and to indicate whether the purchaser is a teacher.
// The store plans to give each customer a printed receipt, so your program i... | 1,328,921 |
the-stack-v2-dedup | C | #include "scanner.ih"
char const *scanner_text()
{
return yytext;
}
| 1,328,922 |
the-stack-v2-dedup | C |
/* ======================================================================= *
* Texas Instruments OMAP(TM) Platform Software * (c) Copyright 2008 Texas
* Instruments Incorporated. All Rights Reserved. * * Use of this software is
* controlled by the terms and conditions found * in the license agreement
* under whic... | 1,328,923 |
the-stack-v2-dedup | C | #include<stdio.h>
//整型提升
//int main()
//{
// int a = -10;
// unsigned int b = 5;
// if (a + b > 0)//a和b运算时，编译器会将a隐式类型转换为unsigned类型
// {
// printf(">0\n");
// }
// else
// {
// printf("<0\n");
// }
// return 0;
//}
#if 0
int main()
{
char a = 0x80;//1000 0000
unsigned char b = 0x80;//1000 0000
unsigned int c = a;/... | 1,328,924 |
the-stack-v2-dedup | C | /* system/debuggerd/debuggerd.c
**
** Copyright 2006, The Android Open Source Project
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
... | 1,328,925 |
the-stack-v2-dedup | C | /************************************`
* sub10_exc_6-6_wage.c
* Author: Iwabuchi Ken *
* Date: 20120213_072945
* <Aim>
* 1. Calculate wages
* Usage:
* 1. Execute the program *
* <Source>
* 1. Oualline: 85
* <Related>
* 1.
************************************/
#ifndef INCLUDE_STDIO_H
#define INCLUDE... | 1,328,926 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_memcmp.c :+: :+: :+... | 1,328,927 |
the-stack-v2-dedup | C | /*
Code to convert text to telephone nuber
*/
#include<stdio.h>
int main()
{
char str[100];
printf("Enter the string: ");
scanf("%[^\n]s",str);
int i;
for(i=0;str[i]!='\0';i++)
{
if(str[i]<'A'||str[i]>'Z')
{
printf("%c",str[i]);
}
else
{
if(str[i]-'A'<=2)
printf("2");
else ... | 1,328,928 |
the-stack-v2-dedup | C | #include <sys/time.h>
#include <unistd.h>
#include <errno.h>
#include "inner_fd.h"
#include "task.h"
#include "list.h"
#define INVALID_FD -1
#define MAX_FD_NUM 102400
//5 seconds
#define FD_TIMEOUT 3
static inner_fd* g_inner_fd_list[MAX_FD_NUM] = {0};
int is_fd_valid(int fd) {
return (fd > INVALID_FD && fd < MA... | 1,328,929 |
the-stack-v2-dedup | C | /*-
* SPDX-License-Identifier: BSD-2-Clause-FreeBSD
*
* Copyright (c) 2011 Nathan Whitehorn
* Copyright (c) 2014 Devin Teske <dteske@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* ... | 1,328,930 |
the-stack-v2-dedup | C |
#include <stdio.h>
#include <string.h>
#include <windows.h>
#include "UIManage.h"
#include "igetopt.h"
char **GetArgs(int *pa_argc)
{
int i;
char **pa_argv;
size_t l;
LPWSTR *WArgV=CommandLineToArgvW(GetCommandLineW(), pa_argc);
pa_argv=(char **)malloc(*pa_argc*sizeof(char *));
for (i=0; i < *pa_argc... | 1,328,931 |
the-stack-v2-dedup | C | #pragma once
struct cache_log *generate_log(struct cache_entry *entry, int type);
int commit_log(struct cache_log *log);
void recovery();
void block_recovery(struct cache_entry *entry);
| 1,328,932 |
the-stack-v2-dedup | C | /*
** EPITECH PROJECT, 2018
** my_sh
** File description:
** main program for minishell1
*/
#include "../headers/fourty_two_sh.h"
char *search_home(char **env)
{
char *tild = malloc(sizeof(char) * 255);
for (int i = 0; env[i]; i++) {
if (length_diff(env[i], "HOME")) {
tild = copy_after_sl... | 1,328,933 |
the-stack-v2-dedup | C | #ifndef MESSAGETYPE_H_
#define MESSAGETYPE_H_
/*
* Message Formats:
*
* ChangeNext <SENDER> <TIMESTAMP> <NEXT>
* -----------------------
* PingRequest <SENDER> <TIMESTAMP>
* -----------------------
* PingReply <SENDER> <TIMESTAMP>
* -----------------------
* Heartbeat <SENDER> <TIMESTAMP>
* -----------------... | 1,328,934 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_lstadd.c :+: :+: :+: ... | 1,328,935 |
the-stack-v2-dedup | C | #ifndef __BASIC_H
#define __BASIC_H
#include <stdlib.h>
#include <string.h>
#define CombineStack struct COMBINE
void itoa(int num, char* str);
struct COMBINE {
int stackSize;
int maxSize;
int* stack;
};
void initCombine(CombineStack* stack ,int degree);
void push(CombineStack* stack,int value);
int pop(CombineStac... | 1,328,936 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<stdlib.h>
typedef struct{
int r;
char n[32];
float m;
}stu;
int scan(stu* st_ptr[])
{
int i,num;
scanf("%d",&num);
stu* st_list=(stu *)malloc(num*sizeof(stu));
for(i=0;i<num;i++){
st_ptr[i]=&st_list[i];
scanf("%d %s %f",&st_ptr[i]->r,st_ptr[i]->n,&st_ptr[i]->m);}
return num;
}
void print(s... | 1,328,937 |
the-stack-v2-dedup | C | typedef struct Exp *Exp;
typedef enum { NumX, AddrX, SymX, UnX, BinX, CondX } ExpTag;
struct Exp {
word Hash, Line, File; bool Mark, Map;
ExpTag Tag; Exp Tail, Next;
union {
word Value;
struct { Segment Seg; word Offset; } Addr;
Symbol Sym;
struct { Lexical Op; Exp A, B, C; } Funct;
... | 1,328,938 |
the-stack-v2-dedup | C | /**************************************************************************
* FILE NAME: $RCSfile: typedefs.h,v $ COPYRIGHT (c) Freescale 2007 *
* DESCRIPTION: All Rights Reserved *
* This file defines all of the data types for the JDP header file. *
*==============... | 1,328,939 |
the-stack-v2-dedup | C | /**
*@brief Ejercicio 12a
*@author Lucia Rivas Molina <lucia.rivasmolina@estudiante.uam.es>
*@author Daniel Santo-Tomas Lopez <daniel.santo-tomas@estudiante.uam.es>
*@file ejercicio12a.c
*@date 2018/03/07
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/wait.h>
#include <t... | 1,328,940 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/mman.h>
#include <sys/shm.h>
#include <sys/ipc.h>
#include <fcntl.h>
#include <unistd.h>
struct packet{
int id;
short dataShort[5];
long dataLong[5];
double dataDouble[5];
char dataByte[6];
}... | 1,328,941 |
the-stack-v2-dedup | C | /******************************************************************
* Melissa *
*-----------------------------------------------------------------*
* COPYRIGHT (C) 2017 by INRIA and EDF. ALL RIGHTS RESERVED. *
* ... | 1,328,942 |
the-stack-v2-dedup | C | #include<mpi.h>
#include<stdio.h>
int main(int argc,char *argv[ ])
{
int size,myrank;
MPI_Init(&argc,&argv);
MPI_Comm_size(MPI_COMM_WORLD,&size);
MPI_Comm_rank(MPI_COMM_WORLD,&myrank);
printf("Process %d of %d, Hello World\n",myrank,size);
MPI_Finalize();
return 0;
} | 1,328,943 |
the-stack-v2-dedup | C | int ReadADC(char i); | 1,328,944 |
the-stack-v2-dedup | C | /// Program to implement Circular Queue using Array
#include <stdio.h>
#define MAX 10
// Queue-like Array
int Q[MAX];
// Menu Driven, Operation Selector
int op=0;
// Front Pointer for Queue
int f=-1;
// Rear Pointer for Queue
int r=-1;
// Value, Element
int val,e;
// Counter
int i;
void insert(int e)
{
// Overflow C... | 1,328,945 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* bzero.c :+: :+: :+: ... | 1,328,946 |
the-stack-v2-dedup | C | // Copyright 2016 The Cobalt Authors. All Rights Reserved.
//
// 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 ap... | 1,328,947 |
the-stack-v2-dedup | C | #include<stdio.h>
int main()
{
char name[20];
float salary, total_sales, total_salary;
scanf("%s", &name);
scanf("%f %f", &salary, &total_sales);
total_salary = (15*total_sales)/100;
printf("TOTAL = R$ %.2f\n", salary + total_salary);
return 0;
} | 1,328,948 |
the-stack-v2-dedup | C | #include <stdlib.h>
#include "reverse_bits.h"
unsigned int reverse_bits(unsigned int num)
{
unsigned int count = sizeof(int) * CHAR_BIT - 1;
unsigned int reverse_num = num;
num >>= 1;
while (num)
{
reverse_num <<= 1;
reverse_num |= num & 1;
num >>= 1;
... | 1,328,949 |
the-stack-v2-dedup | C | #ifndef __UPDATE_H
#define __UPDATE_H
char fontupdata_task_init(void *p_arg);
void fontupdata_task(void *p_arg);
char updatefont_task_deinit(void* p_arg);
#endif
| 1,328,950 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* :::::::: */
/* matrix_get_det.c :+: :+: ... | 1,328,951 |
the-stack-v2-dedup | C | /* matrix_d.h
* Copyright 2016 Mac Radigan
* All Rights Reserved
* NOTICE: This source file was automatically generated on 2017-06-25 03:25:54 by dox.
*/
#include "../common/status.h"
#include "../matrix/matrix.h"
#include <stdlib.h>
#include <inttypes.h>
#ifndef matrix_d_h
#define matrix_d_h
#ifdef __cplusplus... | 1,328,952 |
the-stack-v2-dedup | C | /* Generated by Nim Compiler v0.19.0 */
/* (c) 2018 Andreas Rumpf */
/* The generated code is subject to the original license. */
#define NIM_NEW_MANGLING_RULES
#define NIM_INTBITS 32
#include "nimbase.h"
#include <string.h>
#undef LANGUAGE_C
#undef MIPSEB
#undef MIPSEL
#undef PPC
#undef R3000
#undef R4000
#undef i3... | 1,328,953 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* history.h :+: :+: :+: ... | 1,328,954 |
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,328,955 |
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,328,956 |
the-stack-v2-dedup | C | //- Filter sizes
if(fluidCoarsening)
{
//- Fluid Coarsening
forAll(filterWidth,fWidth)
{
//- Create name for filter width
char charName[100];
sprintf(charName, "%dX%dX%d",filterWidth[fWidth],filterWidth[fWidth],filterWidth[fWidth]);
word filterWidthName(charName);
// Create header for outpu... | 1,328,957 |
the-stack-v2-dedup | C | // Aokromes, Septiembre de 1999
#include "../path.h"
inherit REAL+"afueras4.c";
void setup()
{
set_short("%^RED%^%^BOLD%^Real Camino de Anduar a Dendara%^RESET%^");
set_long("Estas en una amplia calzada de 10 metros de ancho que va desde "
"Anduar a la ciudad de Dendara, en este tramo el camino se dirige otra... | 1,328,958 |
the-stack-v2-dedup | C | #include <sys/types.h>
#include <sys/dir.h>
#include <sys/param.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <string.h>
#include <time.h>
extern int alphasort();
char pathname[MAXPATHLEN];
int calcularTempoCriacao(struct stat);
int main() {
int count,i;
struct direct... | 1,328,959 |
the-stack-v2-dedup | C | //Group No. 7
//ANIRUDH GOYAL 2017A7PS0031P
//ANISHKUMAR SS 2017A7PS0069P
//ROHIT JAIN 2017A7PS0122P
//ADITYA SAXENA 2017A7PS0166P
#include "SymbolTable.h"
// Data Structure for Function Table
// Enum for storing the status of the Module
typedef enum{DECLARED, DEFINED, DECANDDEF} status;
// Structure ... | 1,328,960 |
the-stack-v2-dedup | C | #include <stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF && n!=0)
{
int x10 , x16 , x12;
x10 = n%10+n/10%10+n/100%10+n/1000%10;
x16 = n%16+n/16%16+n/256%16+n/4096%16;
x12 = n%12+n/12%12+n/144%12+n/1728%12;
if(x10 == x16 && x16 == x12)
{
printf("%d is a Sky Number.\n",n);
}
else
{
prin... | 1,328,961 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include "dll.h"
dll *newDLL(void (*d)(FILE *,void *)) //constructor for dll
{
dll *items = malloc(sizeof(dll));
if(items == 0)
{
fprintf(stderr,"out of memory");
exit(-1);
}
items->head = 0;
items->tail = 0;
items->size = 0;
items->display = d;
return items;
}
int ... | 1,328,962 |
the-stack-v2-dedup | C | #include "includes.h"
#ifndef ARRSIZE
#define ARRSIZE(xxxx) (sizeof((xxxx))/sizeof((xxxx)[0]))
#endif
const u8 gameHashTable[] =
{
0x71, 0x00,
0xFF, 0x00,
0x00, 0x00,
0x15, 0x00,
0xDB, 0x00,
0x00, 0x00,
0x88, 0x00,
0x00, 0x00,
0x0C, 0x00,
0x16, 0x00,
0x35, 0x00,
0x67, 0x00,
0x75, 0x00,
0x92, 0x00... | 1,328,963 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <malloc.h>
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode {
int val;
struct ListNode *next;
};
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
struct ListNode *ans=... | 1,328,964 |
the-stack-v2-dedup | C | /*In this file include main prototypes of functions to work with structure List, some function types and main list structure (List)*/
#ifndef __flist_h__
#define __flist_h__
/** Structure of list object*/
struct List {
List* next; /*pointer to next item in list*/
void* data; /*pointer to other data in list, s... | 1,328,965 |
the-stack-v2-dedup | C | #ifndef PROTO
#define PROTO
#define MIN_LENGTH_NAME 2 // La taille min d'un nom
#define MAX_LENGTH_NAME 31 // La taille max d'un nom
#define LENGTH_MSG 500 // La taille max d'un message
#define LENGTH_SEND 500
#define PORT 4444 // Le numéro du port à utiliser
#endif // PROTO
| 1,328,966 |
the-stack-v2-dedup | C | /* Copyright 2006-2020, BeatriX
* File coded by BeatriX
*
* This file is part of BeaEngine.
*
* BeaEngine is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License,... | 1,328,967 |
the-stack-v2-dedup | C | #pragma once
#include <stdint.h>
#include <assert.h>
#include <exception>
#include "codegen/il2cpp-codegen.h"
// System.Collections.Generic.Comparer`1/DefaultComparer<UnityEngine.UICharInfo>
struct DefaultComparer_t4091;
// UnityEngine.UICharInfo
#include "UnityEngine_UnityEngine_UICharInfo.h"
// System.Void System.... | 1,328,968 |
the-stack-v2-dedup | C | /**
* Morse Code Translator
* Linux kernel module
* Copyright (C) 2014 Ng Tzy Luen. All Rights Reserved.
*
* Tested under GNU C gcc 4.7.2, linux kernel 3.14.0
*/
#ifndef MORSECODE_H
#define MORSECODE_H
#define MORSEDEV_MAJOR 77
static int morsecode_open(struct inode *, struct file *);
static int morsecode_... | 1,328,969 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* itoa.c :+: :+: :+: ... | 1,328,970 |
the-stack-v2-dedup | C | /*====================================================================*
- Copyright (C) 2001 Leptonica. All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source c... | 1,328,971 |
the-stack-v2-dedup | C | /*
* GlobalInformation.h
*
* Created on: Mar 26, 2017
* Author: Nima
*/
#ifndef GLOBALINFORMATION_H_
#define GLOBALINFORMATION_H_
#include <stdint.h>
#define NETWORK_NAME "Nima"
#define NETWORK_PASS "Ne08041373nima?"
//#define NETWORK_NAME "Nima\'s iPhone"
//#define NETWORK_PASS "8064709377"
#define ... | 1,328,972 |
the-stack-v2-dedup | C | /*
* Copyright LWJGL. All rights reserved.
* License terms: https://www.lwjgl.org/license
* MACHINE GENERATED FILE, DO NOT EDIT
*/
#include "common_tools.h"
DISABLE_WARNINGS()
//#define ENABLE_STATISTICS 1
#include "rpmalloc.c"
ENABLE_WARNINGS()
EXTERN_C_ENTER
JNIEXPORT jlong JNICALL JavaCritical_org_lwjgl_system... | 1,328,973 |
the-stack-v2-dedup | C | #pragma once
#include <tchar.h>
#include <windows.h>
#include <sddl.h>
#include <memory.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <io.h>
#include <fcntl.h>
#include "Conts.h"
#include <conio.h>
typedef struct Cell {
int type;
}Cell;
typedef struct Board {
int Objects ... | 1,328,974 |
the-stack-v2-dedup | C | #include <stdio.h>
/**
* main - print the first 98 fibonacci numbers.
* Return: Nothing.
*/
int main(void)
{
int count;
unsigned long i, j, k;
unsigned long m, n, p, carry;
count = 0;
i = 0;
j = 1;
for (count = 1; count <= 91; count++)
{
k = i + j;
i = j;
j = k;
printf("%lu, ", k);
}
m = i % 10... | 1,328,975 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct student
{
char name[20];
int age;
};
int input()
{
FILE *p = fopen("b.dat", "ab");
if (!p)
return 0;
while(1)
{
struct student st = { 0 };
printf("please input name:");
scanf("%s", st.name);
printf("please input age:");
scanf("%d", &... | 1,328,976 |
the-stack-v2-dedup | C | /*
* Copyright (C) 2003 Texas Instruments Incorporated
* All Rights Reserved
*/
/*
*---------profiler_timer2.h---------
* This file list all the symbols and API's provided by the profiler
* to the users.
*/
#include <csl.h>
#include <csl_timer.h>
//---------Error codes for the profiler functions----... | 1,328,977 |
the-stack-v2-dedup | C | /*
* Copyright (C) Hisilicon Technologies Co., Ltd. 2019-2019. All rights reserved.
* Description: audio memory interface
* Author: audio
* Create: 2019-05-30
* Notes: NA
* History: 2019-05-30 Initial version for Hi3796CV300
*/
#ifndef __AUDIO_MEM_H__
#define __AUDIO_MEM_H__
#include "hi_drv_audio.h"
hi_s32 ... | 1,328,978 |
the-stack-v2-dedup | C | /*
Our webserver is a 10 socket server. It uses mutexes to protect data during threading.
The server waits for a connection then it creates a thread and calls the echo function.
It is a robust implementation in that it will respond to both http 1.0 and http 1.1
requests given the correct header as well as safely h... | 1,328,979 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "utn.h"
#define FREE 1
#define OCCUPIED 0
int initEmployees(Employee List[], int len)///inicializar
{
int index;
int returno = 1;
if(len > 0)
{
for(index = 0; index < len; index++)
{
List[in... | 1,328,980 |
the-stack-v2-dedup | C | #pragma once
#include "../../stdafx.h"
extern CColor LightGray;
extern CColor Gray;
extern CColor DarkGray;
extern CColor MainColor;
extern CColor MiddleGray;
extern CColor Black;
inline void DrawRect(int x1, int y1, int x2, int y2, CColor clr)
{
Interfaces.pSurface->DrawSetColor1(clr);
Interfaces.pSurface->DrawFil... | 1,328,981 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <stdint.h>
uint64_t f_u_csabam8_rca_h2_v3(uint64_t a, uint64_t b){
uint64_t f_u_csabam8_rca_h2_v3_out = 0;
uint8_t f_u_csabam8_rca_h2_v3_and1_2 = 0;
uint8_t f_u_csabam8_rca_h2_v3_and2_2 = 0;
uint8_t f_u_csabam8_rca_h2_v3_and3_2 = 0;
uint8_t f_u_csabam8_rca_h2_v3_and4_2 = 0;
uint... | 1,328,982 |
the-stack-v2-dedup | C | /*
* This file is subject to the license agreement located in the file LICENSE
* and cannot be distributed without it. This notice cannot be
* removed or modified.
*/
//gcc -DENABLE_EXTENSION_PARAMS_EVT -DENABLE_EXTENSION_CHANNEL_EVT -I${OCR_INSTALL}/include -L${OCR_INSTALL}/lib -locr_${OCR_TYPE} ocr-reservations.... | 1,328,983 |
the-stack-v2-dedup | C | #include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include "module.h"
#include "network.h"
#define JOINER "&" /*Used this to join parts report info*/
typedef enum{
EVERYTIME = 1, /*report eve... | 1,328,984 |
the-stack-v2-dedup | C | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_vector.h :+: :+: :+: ... | 1,328,985 |
the-stack-v2-dedup | C | #pragma once
#include "ParticleSystem.h"
#include "EmitterRect.h"
#include "ForceAttraction.h"
#include "ForceWind.h"
#include "ForceAttraction.h"
#include "ForcefieldNoise.h"
#include "ForcefieldFlow.h"
#include "RenderLines.h"
#include "RenderPoints.h"
| 1,328,986 |
the-stack-v2-dedup | C | /* Biblioteca para obtener el promedio de 3 enteros */
#include "tp4_15b.h"
int
fAuxiliar (int n, int m, int p)
{
return n + m + p;
}
float
promedio3 (int n, int m, int p)
{
return fAuxiliar(n,m,p) / 3.0;
}
| 1,328,987 |
the-stack-v2-dedup | C | #include<stdio.h>
#include<conio.h>
void main()
{
int a;
float b;
char c;
double d;
long double e;
signed int f;
unsigned char g;
short h;
long int i;
unsigned short j ;
unsigned long int k;
unsigned int l;
... | 1,328,988 |
the-stack-v2-dedup | C | /*
============================================================================
Name : V00816592A3P1.c
Author : Isaac Sahle
Date : 09/30/14
Description : Calculate different volumes and areas of shapes.
============================================================================
*/
#include <... | 1,328,989 |
the-stack-v2-dedup | C | // 将两个子列归并成一个有序的子列
void Merge(int Arr[], int TempArr[], int LeftStart, int RightStart, int RightEnd)
{
int i;
int LeftEnd = RightStart - 1;
int ElementNums = RightEnd - LeftStart + 1;
int TempStart = LeftStart;
while (LeftStart <= LeftEnd && RightStart <= RightEnd) {
if (Arr[LeftStart] <= Arr[RightStar... | 1,328,990 |
the-stack-v2-dedup | C | /*
* libexif example program to extract an EXIF thumbnail from an image
* and save it into a new file.
*
* Placed into the public domain by Dan Fandrich
*/
#include <stdio.h>
#include <libexif/exif-loader.h>
int main(int argc, char **argv)
{
int rc = 1;
ExifLoader *l;
if (argc < 2) {
printf(... | 1,328,991 |
the-stack-v2-dedup | C | #include <unistd.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <sys/types.h>
#include <fcntl.h>
#include <stdlib.h>
#include <stdio.h>
#include <errno.h>
#include <string.h>
#include <signal.h>
#include <sys/time.h>
#define ERR_EXIT(m) \
do\
{\
perror(m);\
exit(EXIT_FAILURE);\
}whi... | 1,328,992 |
the-stack-v2-dedup | C | #ifndef TESTS_H_
#define TESTS_H_
#include "commonClasses.h"
void testGriddata2();
void testCountryData();
void testVector2d();
#endif | 1,328,993 |
the-stack-v2-dedup | C | #include <stdint.h>
#include <stdio.h>
#include <string.h>
//------
typedef uint32_t u32;
typedef uint8_t u8;
#define debug printf
//------
#define NR_OUTPUT_BITS 32
#define MICKEY_IV_SIZE 80
#define NR_INIT_ROUNDS 100
#define R_Mask0 0x1279327b
#define R_Mask1 0xb5546660
#define R_Mask2 0xdf87818f
#define ... | 1,328,994 |
the-stack-v2-dedup | C | /*
** EPITECH PROJECT, 2019
** get_next_line project
** File description:
** get_next_line
*/
#include "get_next_line.h"
char *get_old(res_s *result, params_s *params);
static char *my_strncpy(char *dest, char *src, int n)
{
int i;
for (i = 0; src[i] != '\0' && i < n; i++)
dest[i] = src[i];
if (... | 1,328,995 |
the-stack-v2-dedup | C | #include <stdlib.h>
#include <discord_game_sdk.h>
#include "de_jcm_discordgamesdk_ActivityManager.h"
#include "Callback.h"
JNIEXPORT jobject JNICALL Java_de_jcm_discordgamesdk_ActivityManager_registerCommand(JNIEnv *env, jobject object, jlong pointer, jstring command)
{
struct IDiscordActivityManager *activity_manag... | 1,328,996 |
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,328,997 |
the-stack-v2-dedup | C | /*
* =====================================================================================
*
* Filename: ch_protocol_type.h
*
* Description:
*
* Version: 1.0
* Created: 2016年01月27日 11时50分44秒
* Revision: none
* Compiler: gcc
*
* Author: shajf (), csp001314@1... | 1,328,998 |
the-stack-v2-dedup | C | /*
* Copyright (c) 2006-2020, RT-Thread Development Team
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2020-06-09 Jackis the first version
*/
#include <rtthread.h>
#include <board.h>
#include <rtdevice.h>
#include <string.h>
//#include "sit-and-reach.... | 1,328,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.