repo stringlengths 4 140 | commit_id stringlengths 7 7 | rel_path stringlengths 1 3.5k | language stringclasses 37
values | url stringlengths 37 3.56k | raw_url stringlengths 54 3.58k | key stringlengths 20 3.54k | ok bool 1
class | status int64 200 200 | bytes int64 48 425k | content stringlengths 40 425k | worker_id int64 0 7 |
|---|---|---|---|---|---|---|---|---|---|---|---|
neurotrip/code | 833ad82 | Prata_C/examples_chapter_16/example_16.1/preproc.c | C | www.github.com/neurotrip/code/tree/main/Prata_C/examples_chapter_16/example_16.1/preproc.c | https://raw.githubusercontent.com/neurotrip/code/833ad82/Prata_C/examples_chapter_16/example_16.1/preproc.c | neurotrip/code 833ad82 Prata_C/examples_chapter_16/example_16.1/preproc.c | true | 200 | 362 | #include <stdio.h>
#define TWO 2
#define OW "Логика - последнее убежище лишенных воображения. - Оскар Уальд"
#define FOUR TWO*TWO
#define PX printf("X = %d.\n", x)
#define FMT "X = %d.\n"
int main(void)
{
int x = TWO;
PX;
x = FOUR;
printf(FMT, x);
printf("%s\n", OW);
printf("TWO: OW\n");
return 0;
}
| 1 |
Osbond/alx-low_level_programming | 3c040d1 | 0x05-pointers_arrays_strings/0-main.c | C | www.github.com/Osbond/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/0-main.c | https://raw.githubusercontent.com/Osbond/alx-low_level_programming/3c040d1/0x05-pointers_arrays_strings/0-main.c | Osbond/alx-low_level_programming 3c040d1 0x05-pointers_arrays_strings/0-main.c | true | 200 | 229 | #include "main.h"
#include <stdio.h>
/**
* main - Collects other functions
*
* Return: Always 0
*/
int main(void)
{
int n;
n = 402;
printf("n=%d\n", n);
reset_to_98(&n);
printf("n=%d\n", n);
return (0);
}
| 7 |
judge2005/EleksTubeIPS | 4d153fa | src/GLOBAL_DEFINES.h | C | www.github.com/judge2005/EleksTubeIPS/tree/main/src/GLOBAL_DEFINES.h | https://raw.githubusercontent.com/judge2005/EleksTubeIPS/4d153fa/src/GLOBAL_DEFINES.h | judge2005/EleksTubeIPS 4d153fa src/GLOBAL_DEFINES.h | true | 200 | 4,562 | /*
* Author: Aljaz Ogrin
* Project: Alternative firmware for EleksTube IPS clock
* Hardware: ESP32
* File description: Hardware Global configuration for the complete project
* Should only need editing for a new version of the clock
* User defines are located in "USER_DEFINES.h"
*/
#ifndef GLOBAL_DEFIN... | 3 |
Z3D3S/BeecrowdProblemSolving | a974acf | SolvingInC/uri1010.c | C | www.github.com/Z3D3S/BeecrowdProblemSolving/tree/main/SolvingInC/uri1010.c | https://raw.githubusercontent.com/Z3D3S/BeecrowdProblemSolving/a974acf/SolvingInC/uri1010.c | Z3D3S/BeecrowdProblemSolving a974acf SolvingInC/uri1010.c | true | 200 | 531 | #include <stdio.h>
int main() {
int ID_1,QUANTIDADE_1;
float VALOR_1;
int ID_2,QUANTIDADE_2;
float VALOR_2;
float VALORAPAGAR;
scanf("%d", &ID_1);
scanf("%d", &QUANTIDADE_1);
scanf("%f", &VALOR_1);
scanf("%d", &ID_2);
scanf("%d", ... | 2 |
Jessicasaduwa/alx-low_level_programming | 1e9bceb | 0x15-file_io/0-read_textfile.c | C | www.github.com/Jessicasaduwa/alx-low_level_programming/tree/main/0x15-file_io/0-read_textfile.c | https://raw.githubusercontent.com/Jessicasaduwa/alx-low_level_programming/1e9bceb/0x15-file_io/0-read_textfile.c | Jessicasaduwa/alx-low_level_programming 1e9bceb 0x15-file_io/0-read_textfile.c | true | 200 | 690 | #include "main.h"
/**
* read_textfile - reads a text file and prints to the POSIX standard output.
* @filename: name of the text file.
* @letters: number of letters.
* Return: the actual number of letters it could read and print
* On Error, return 0.
*/
ssize_t read_textfile(const char *filename, size_t letters)... | 5 |
abdelhafid-mahmoudi-env/alx-low_level_programming | d0ba51b | 0x15-file_io/2-append_text_to_file.c | C | www.github.com/abdelhafid-mahmoudi-env/alx-low_level_programming/tree/main/0x15-file_io/2-append_text_to_file.c | https://raw.githubusercontent.com/abdelhafid-mahmoudi-env/alx-low_level_programming/d0ba51b/0x15-file_io/2-append_text_to_file.c | abdelhafid-mahmoudi-env/alx-low_level_programming d0ba51b 0x15-file_io/2-append_text_to_file.c | true | 200 | 744 | #include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <unistd.h>
#include "main.h"
#include <string.h>
/**
* append_text_to_file - Appends text to the end of a file.
* @filename: The name of the file.
* @text_content: The text content to append.
*
* Return: 1 on success, -1 on failure.
*/
int append... | 4 |
yzhhe/CVEAffectedVersions | 8c53a62 | CVEBounds/Linux Kernel Patch_v2.0/Linux Kernel Patch_v2.0/CVE-2017-9074/(AM)net#~ipv6#~ip6_offload.c | C | www.github.com/yzhhe/CVEAffectedVersions/tree/main/CVEBounds/Linux Kernel Patch_v2.0/Linux Kernel Patch_v2.0/CVE-2017-9074/(AM)net#~ipv6#~ip6_offload.c | https://raw.githubusercontent.com/yzhhe/CVEAffectedVersions/8c53a62/CVEBounds/Linux%20Kernel%20Patch_v2.0/Linux%20Kernel%20Patch_v2.0/CVE-2017-9074/%28AM%29net%23~ipv6%23~ip6_offload.c | yzhhe/CVEAffectedVersions 8c53a62 CVEBounds/Linux Kernel Patch_v2.0/Linux Kernel Patch_v2.0/CVE-2017-9074/(AM)net#~ipv6#~ip6_offload.c | true | 200 | 9,682 | /*
* IPV6 GSO/GRO offload support
* Linux INET6 implementation
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version
* 2 of the License, or (at your option) any ... | 1 |
danielmateu/piscine42-main | e62285c | learningC/04-bucles/main.c | C | www.github.com/danielmateu/piscine42-main/tree/main/learningC/04-bucles/main.c | https://raw.githubusercontent.com/danielmateu/piscine42-main/e62285c/learningC/04-bucles/main.c | danielmateu/piscine42-main e62285c learningC/04-bucles/main.c | true | 200 | 1,234 | // bucles en C
#include <stdio.h>
#include <unistd.h>
int main()
{
// bucle while. Evaluamos la condicion. Si es verdadera, ejecutamos el codigo
// dentro del bucle. Si es falsa, salimos del bucle.
int i = 0;
while (i < 10)
{
printf("i = %d\n", i);
i++;
}
// bucle do-while... | 7 |
Nijhor/C_basic_problem | d677c90 | lab3.c | C | www.github.com/Nijhor/C_basic_problem/tree/main/lab3.c | https://raw.githubusercontent.com/Nijhor/C_basic_problem/d677c90/lab3.c | Nijhor/C_basic_problem d677c90 lab3.c | true | 200 | 575 | #include<stdio.h>
#define SIZE 100
int main()
{
int i,j,n,c=0;
int x[50];
int y[SIZE];
for(i=0;i<50;i++)
{
x[i]=1+rand()%50;
printf("%d\n",x[i]);
}
for(j=0;j<SIZE;j++)
{
y[j]=0;
scanf("%d",&n);
if(n==-1)
break;
for(i=0;i<50;i++)... | 3 |
HYDRO2070/CodeWithHarray-DSA | 2d57b41 | Graph/Insertion_in_graph_matrix.c | C | www.github.com/HYDRO2070/CodeWithHarray-DSA/tree/main/Graph/Insertion_in_graph_matrix.c | https://raw.githubusercontent.com/HYDRO2070/CodeWithHarray-DSA/2d57b41/Graph/Insertion_in_graph_matrix.c | HYDRO2070/CodeWithHarray-DSA 2d57b41 Graph/Insertion_in_graph_matrix.c | true | 200 | 1,456 | #include<stdio.h>
#include<stdlib.h>
#define MAX_VERTICES 100
int visited[7]={0,0,0,0,0,0,0};
struct graph{
int numvertices;
int adj_martrix[MAX_VERTICES][MAX_VERTICES];
};
struct graph* creategraph(int vertices){
struct graph* gra=(struct graph*)malloc(sizeof(struct graph));
gra->numvertices=... | 2 |
Muyilaian/Muyilaian | 5516322 | CAT2.Q2.c | C | www.github.com/Muyilaian/Muyilaian/tree/main/CAT2.Q2.c | https://raw.githubusercontent.com/Muyilaian/Muyilaian/5516322/CAT2.Q2.c | Muyilaian/Muyilaian 5516322 CAT2.Q2.c | true | 200 | 476 | // An array is a data structure that stores a collection of elements of the same data types in contiguous memory location
//Array program
/*
Author:Muyila Wekesa Ian
Reg:CT101/G/24568/24
Date:7/7/24
*/
#include <stdio.h>
int main() {
int scores[2][2] = {{{65, 92},{84, 72}}, {{35, 70},{59, 67}}};
for (in... | 5 |
Gumbo64/sm64-AI-DX | 134e047 | sm64env/sm64coopdx/levels/lll/tilting_square_platform/model.inc.c | C | www.github.com/Gumbo64/sm64-AI-DX/tree/main/sm64env/sm64coopdx/levels/lll/tilting_square_platform/model.inc.c | https://raw.githubusercontent.com/Gumbo64/sm64-AI-DX/134e047/sm64env/sm64coopdx/levels/lll/tilting_square_platform/model.inc.c | Gumbo64/sm64-AI-DX 134e047 sm64env/sm64coopdx/levels/lll/tilting_square_platform/model.inc.c | true | 200 | 2,149 | #include "pc/rom_assets.h"
// 0x0701A080 - 0x0701A120
ROM_ASSET_LOAD_VTX(lll_seg7_vertex_0701A080, 0x004784a0, 83204, 0x0001a080, 160);
// 0x0701A120 - 0x0701A160
ROM_ASSET_LOAD_VTX(lll_seg7_vertex_0701A120, 0x004784a0, 83204, 0x0001a120, 64);
// 0x0701A160 - 0x0701A1A8
static const Gfx lll_seg7_dl_0701A160[] = {
... | 4 |
cocolab8/cocktail | c8c9b8f | cg/m2c/EvalJav3.h | C | www.github.com/cocolab8/cocktail/tree/main/cg/m2c/EvalJav3.h | https://raw.githubusercontent.com/cocolab8/cocktail/c8c9b8f/cg/m2c/EvalJav3.h | cocolab8/cocktail c8c9b8f cg/m2c/EvalJav3.h | true | 200 | 439 | #define DEFINITION_EvalJav3
#ifndef DEFINITION_IO
#include "IO.h"
#endif
#ifndef DEFINITION_Tree
#include "Tree.h"
#endif
extern ZfM_3 ZbpA7kgAe_0;
extern BOOLEAN ZbpA7kgAe_1;
extern PROC ZbpA7kgAe_2;
extern void ZbpA7kgAe_3 ARGS ((Zq0A4_153 Z122));
extern INTEGER ZbpA7kgAe_4 ARGS ((Zq0A4_153 Z125, INTEGER Z126));
e... | 3 |
valentiniluis/Pesquisa-e-Ordenacao-de-Dados | 146bbef | exercicios_arquivos/e5.c | C | www.github.com/valentiniluis/Pesquisa-e-Ordenacao-de-Dados/tree/main/exercicios_arquivos/e5.c | https://raw.githubusercontent.com/valentiniluis/Pesquisa-e-Ordenacao-de-Dados/146bbef/exercicios_arquivos/e5.c | valentiniluis/Pesquisa-e-Ordenacao-de-Dados 146bbef exercicios_arquivos/e5.c | true | 200 | 704 | #include <stdio.h>
// 5) Contagem de Caracteres Específicos: Crie um programa que conte quantas vezes
// um caractere específico aparece em um arquivo de texto. Permita que o usuário
// especifique o caractere a ser contado.
int contarOcorrencias(FILE *arq, char caractere) {
char c;
int contador = 0;
whi... | 2 |
mega-mind01/alx-low_level_programming | 209ad9e | 0x04-more_functions_nested_loops/9-fizz_buzz.c | C | www.github.com/mega-mind01/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/9-fizz_buzz.c | https://raw.githubusercontent.com/mega-mind01/alx-low_level_programming/209ad9e/0x04-more_functions_nested_loops/9-fizz_buzz.c | mega-mind01/alx-low_level_programming 209ad9e 0x04-more_functions_nested_loops/9-fizz_buzz.c | true | 200 | 370 | #include <stdio.h>
/**
* main - Entry point of program
*
* Return: void
*/
int main(void)
{
int i;
for (i = 1; i < 100; i++)
if (i % 15 == 0)
{
printf("FizzBuzz ");
}
else if (i % 5 == 0)
{
printf("Buzz ");
}
else if (i % 3 == 0)
{
printf("Fizz ");
}
else
{
printf("%d ", i);
... | 7 |
OmniGirl/alx-low_level_programming | 1273dfa | 0x00-hello_world/101-quote.c | C | www.github.com/OmniGirl/alx-low_level_programming/tree/main/0x00-hello_world/101-quote.c | https://raw.githubusercontent.com/OmniGirl/alx-low_level_programming/1273dfa/0x00-hello_world/101-quote.c | OmniGirl/alx-low_level_programming 1273dfa 0x00-hello_world/101-quote.c | true | 200 | 233 | #include <stdio.h>
#include <unistd.h>
/**
* main -A C program that prints a line to the standard error
* Return:1
*/
int main(void)
{
write(2, "and that piece of art is useful\" - Dora Korpar, 2015-10-19\n", 59);
return (1);
}
| 1 |
goonerlabs/sorting_algorithms | 8c031fa | 102-counting_sort.c | C | www.github.com/goonerlabs/sorting_algorithms/tree/main/102-counting_sort.c | https://raw.githubusercontent.com/goonerlabs/sorting_algorithms/8c031fa/102-counting_sort.c | goonerlabs/sorting_algorithms 8c031fa 102-counting_sort.c | true | 200 | 877 | #include "sort.h"
/**
* counting_sort - Sort an array of integers in ascending order
*
* @array: The array to be sorted
* @size: Number of elements in the array
*/
void counting_sort(int *array, size_t size)
{
int k, *arr1, *arr2;
size_t i;
if (!array || size < 2)
return;
k = array[0];
for (i = 1; i < si... | 5 |
Vikk-17/college | 037e994 | sem_1/dsa/lab/postfix_eval/postfix_eval.c | C | www.github.com/Vikk-17/college/tree/main/sem_1/dsa/lab/postfix_eval/postfix_eval.c | https://raw.githubusercontent.com/Vikk-17/college/037e994/sem_1/dsa/lab/postfix_eval/postfix_eval.c | Vikk-17/college 037e994 sem_1/dsa/lab/postfix_eval/postfix_eval.c | true | 200 | 872 | #include<stdio.h>
#include<math.h>
#include<ctype.h>
#include<string.h>
double compute(char s, double op1, double op2){
switch(s){
case '+': return (op1+op2);
case '-': return (op1-op2);
case '*': return (op1*op2);
case '/': return (op1/op2);
case '$': return (pow(op1,op2));... | 4 |
rbatson/Projects-42 | ded1359 | s21_projects/SimpleBash/src/grep/s21_grep.c | C | www.github.com/rbatson/Projects-42/tree/main/s21_projects/SimpleBash/src/grep/s21_grep.c | https://raw.githubusercontent.com/rbatson/Projects-42/ded1359/s21_projects/SimpleBash/src/grep/s21_grep.c | rbatson/Projects-42 ded1359 s21_projects/SimpleBash/src/grep/s21_grep.c | true | 200 | 4,417 | // Copyright [2022] <rbatson>
#include "./s21_grep.h"
int main(int argc, char **argv) {
char pattern[1024] = {0};
options opt = {0};
parser(argc, argv, &opt, pattern);
open_file(argc, argv, opt, pattern);
return 0;
}
void parser(int argc, char **argv, options *opt, char *pattern) {
int c = 0;
... | 3 |
Raj7745/arithmatic | 2f35768 | area of circle.c | C | www.github.com/Raj7745/arithmatic/tree/main/area of circle.c | https://raw.githubusercontent.com/Raj7745/arithmatic/2f35768/area%20of%20circle.c | Raj7745/arithmatic 2f35768 area of circle.c | true | 200 | 237 | #include<stdio.h>
#include<conio.h>
int main()
{
int no=0;
int area=0;
printf(" enter a number\n");
scanf("%d",&no);
area=no*no*3.14;
printf(" the area of circle is %d\n ",area);
return 0;
} | 2 |
vickerdent/alx-low_level_programming | d677171 | 0x01-variables_if_else_while/8-print_base16.c | C | www.github.com/vickerdent/alx-low_level_programming/tree/main/0x01-variables_if_else_while/8-print_base16.c | https://raw.githubusercontent.com/vickerdent/alx-low_level_programming/d677171/0x01-variables_if_else_while/8-print_base16.c | vickerdent/alx-low_level_programming d677171 0x01-variables_if_else_while/8-print_base16.c | true | 200 | 287 | #include <stdio.h>
/* more headers goes there */
/**
* main - Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
int c = '\n';
char ch = '0';
char cha = 'a';
while (ch <= '9')
{
putchar(ch);
ch++;
}
while (cha <= 'f')
{
putchar(cha);
cha++;
}
putchar(c);
return (0);
}
| 7 |
delvitord/calc-you-later | 38dfc07 | calc-you-later/test/stackChar.c | C | www.github.com/delvitord/calc-you-later/tree/main/calc-you-later/test/stackChar.c | https://raw.githubusercontent.com/delvitord/calc-you-later/38dfc07/calc-you-later/test/stackChar.c | delvitord/calc-you-later 38dfc07 calc-you-later/test/stackChar.c | true | 200 | 1,522 | /*
* File : stackChar.c
* Deskripsi : Body file dari ADT Stack Dinamis yang infotypenya bertipe Char */
#include "stackChar.h"
#include <stdio.h>
#include <conio.h>
void createstackChar(stackChar *s){
top(*s) = nil;
(*s).jumlahTumpukan = 0;
}
addressChar alokasiChar(char x){
tabstackChar *p... | 5 |
fraxer/C-web-framework-core | 485423c | libs/view/viewcommon.c | C | www.github.com/fraxer/C-web-framework-core/tree/main/libs/view/viewcommon.c | https://raw.githubusercontent.com/fraxer/C-web-framework-core/485423c/libs/view/viewcommon.c | fraxer/C-web-framework-core 485423c libs/view/viewcommon.c | true | 200 | 2,540 | #include <stdlib.h>
#include "viewcommon.h"
static void __view_tag_free(view_tag_t* tag);
static void __view_variable_items_free(view_variable_item_t* item);
static void __view_variable_indexes_free(view_variable_index_t* item_index);
/**
* Free a view tag.
*
* @param tag The view tag to free.
* @return void
*/... | 1 |
Pranalinandankar/MKPITS_Pranali_Nandankar_Mar_2022 | 9fbff83 | C program/Binary.c | C | www.github.com/Pranalinandankar/MKPITS_Pranali_Nandankar_Mar_2022/tree/main/C program/Binary.c | https://raw.githubusercontent.com/Pranalinandankar/MKPITS_Pranali_Nandankar_Mar_2022/9fbff83/C%20program/Binary.c | Pranalinandankar/MKPITS_Pranali_Nandankar_Mar_2022 9fbff83 C program/Binary.c | true | 200 | 222 | #include<stdio.h>
#include<conio.h>
void main()
{
int r,c;
for(r=1;r<6;r++)
{
for(c=1;c<=r;c++)
{
if(c%2==0)
{
printf("0");
}
else
{
printf("1");
}
}
printf("\n");
}
}
| 4 |
shamzaou/tesseract | 5752361 | setup/free.c | C | www.github.com/shamzaou/tesseract/tree/main/setup/free.c | https://raw.githubusercontent.com/shamzaou/tesseract/5752361/setup/free.c | shamzaou/tesseract 5752361 setup/free.c | true | 200 | 2,267 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* free.c :+: :+: :+: ... | 2 |
Minashenouda44/alx-low_level_programming | eef6fd5 | 0x05-pointers_arrays_strings/6-puts2.c | C | www.github.com/Minashenouda44/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/6-puts2.c | https://raw.githubusercontent.com/Minashenouda44/alx-low_level_programming/eef6fd5/0x05-pointers_arrays_strings/6-puts2.c | Minashenouda44/alx-low_level_programming eef6fd5 0x05-pointers_arrays_strings/6-puts2.c | true | 200 | 265 | #include "main.h"
/**
* puts2 - function that prints every other character of a string,
* @str: string
* Return: void
*/
void puts2(char *str)
{
int i;
i = 0;
while (str[i] != '\0')
{
if (i % 2 == 0)
_putchar(str[i]);
i++;
}
_putchar('\n');
}
| 3 |
pragakhala10/C_assignment | 4a4ce66 | lab9a.c | C | www.github.com/pragakhala10/C_assignment/tree/main/lab9a.c | https://raw.githubusercontent.com/pragakhala10/C_assignment/4a4ce66/lab9a.c | pragakhala10/C_assignment 4a4ce66 lab9a.c | true | 200 | 1,199 | // Input details of BCT students and display their average marks.
#include<stdio.h>
void main()
{
struct student
{
int roll;
char name[10];
char address[10];
int age;
int marks[3];
}str[10];
int sum=0;
int average[3];
int i;
for(i=0;i<3;i++)
{
printf("Enter the name: ");
scanf("%s",str[i].name);... | 7 |
shreya5394/Comp2 | 1fd3552 | Comp2/Class/Vector/Vector.c | C | www.github.com/shreya5394/Comp2/tree/main/Comp2/Class/Vector/Vector.c | https://raw.githubusercontent.com/shreya5394/Comp2/1fd3552/Comp2/Class/Vector/Vector.c | shreya5394/Comp2 1fd3552 Comp2/Class/Vector/Vector.c | true | 200 | 2,546 | #include <stdio.h>
#include <stdlib.h>
#include "Vector.h"
#include "Status.h"
#include "logger.h"
struct vector
{
int capacity;
int size;
int* data;
};
typedef struct vector Vector;
VECTOR vector_init_default(void)
{
Vector* pVector = NULL;;
pVector = (Vector*) malloc(sizeof(Vector ));
... | 5 |
franzromanov/C_Embedded | b034263 | AVR/ATMEGA328P/USART/UART_str.c | C | www.github.com/franzromanov/C_Embedded/tree/main/AVR/ATMEGA328P/USART/UART_str.c | https://raw.githubusercontent.com/franzromanov/C_Embedded/b034263/AVR/ATMEGA328P/USART/UART_str.c | franzromanov/C_Embedded b034263 AVR/ATMEGA328P/USART/UART_str.c | true | 200 | 686 | //add_lib
#include <avr/io.h>
#include <util/delay.h>
//UART_INIT
void uart_set(){
//set_baud_rate:115200
UBRR0H=(uint8_t)(103>>8);
UBRR0L=(uint8_t)103;
//enable_T&R
UCSR0B|=(1<<TXEN0)|(1<<RXEN0);
//DATA_FRAME:8 BIT :: 1 STOP_BIT
UCSR0C|=(1<<UCSZ00);
}
//transmit_char_type
void transmit_char(unsigned char c... | 1 |
ideapad2009/hal_esp32 | 3f89ef0 | main/hal_uart.c | C | www.github.com/ideapad2009/hal_esp32/tree/main/main/hal_uart.c | https://raw.githubusercontent.com/ideapad2009/hal_esp32/3f89ef0/main/hal_uart.c | ideapad2009/hal_esp32 3f89ef0 main/hal_uart.c | true | 200 | 6,481 | /*******************************************************************************
* Title :
* Filename : hal_uart.c
* Origin Date : 2023/07/18
* Version : 0.0.0
* Compiler : ESP-IDF v5.x
* Target : ESP32
* Notes ... | 0 |
coreJJ-tan/for_stu | a7eb99a | tty杂项/1.c | C | www.github.com/coreJJ-tan/for_stu/tree/main/tty杂项/1.c | https://raw.githubusercontent.com/coreJJ-tan/for_stu/a7eb99a/tty%E6%9D%82%E9%A1%B9/1.c | coreJJ-tan/for_stu a7eb99a tty杂项/1.c | true | 200 | 1,040 | https://www.cnblogs.com/sparkdev/p/11460821.html
https://www.cnblogs.com/sparkdev/p/11605804.html
https://encyclopedia.thefreedictionary.com/Computer+terminal
https://encyclopedia.thefreedictionary.com/pseudo+terminal.
https://www.cnblogs.com/aozhejin/p/16065019.html
https://blog.csdn.net/qq_39785418/article/detai... | 2 |
Michael78Bugaev/aster | 2c2c282 | include/fs/asterfs.h | C | www.github.com/Michael78Bugaev/aster/tree/main/include/fs/asterfs.h | https://raw.githubusercontent.com/Michael78Bugaev/aster/2c2c282/include/fs/asterfs.h | Michael78Bugaev/aster 2c2c282 include/fs/asterfs.h | true | 200 | 1,473 | #ifndef __VFS_ASTERFS_H__
#define __VFS_ASTERFS_H__
#define ASTERFS_MAX_FILES 256
#define ASTERFS_TYPE_FILE 0x01
#define ASTERFS_TYPE_DIRECTORY 0x02
#define ASTERFS_TYPE_BLOCK_DEV 0x03
#define ASTERFS_TYPE_CHAR_DEV 0x04
#include <stdint.h>
#include <fs/devfs.h>
typedef struct {
uint8_t ino... | 3 |
Jesulayomy/c_basics | c455a68 | simple_shell/builtins.c | C | www.github.com/Jesulayomy/c_basics/tree/main/simple_shell/builtins.c | https://raw.githubusercontent.com/Jesulayomy/c_basics/c455a68/simple_shell/builtins.c | Jesulayomy/c_basics c455a68 simple_shell/builtins.c | true | 200 | 3,615 | #include "shell.h"
/**
* my_cd - exits the shell
* @shell: shell data
*
* Return: an exit value
*/
int my_cd(sh_data *shell)
{
int m, n = 0;
char *new_pwd;
char *old_pwd = _getenv(shell, "PWD");
if (shell->arr[1] == NULL)
{
free_arr2(shell->arr);
shell->arr = malloc(sizeof(char *) * 3);
shell->arr[0] ... | 7 |
NenyeIkpa/alx-low_level_programming | 211e416 | 0x0B-malloc_free/3-alloc_grid.c | C | www.github.com/NenyeIkpa/alx-low_level_programming/tree/main/0x0B-malloc_free/3-alloc_grid.c | https://raw.githubusercontent.com/NenyeIkpa/alx-low_level_programming/211e416/0x0B-malloc_free/3-alloc_grid.c | NenyeIkpa/alx-low_level_programming 211e416 0x0B-malloc_free/3-alloc_grid.c | true | 200 | 649 | #include <stdlib.h>
/**
* alloc_grid - returns a pointer to a 2 dimensional array of integers
*
* @width: width of array
* @height: height of array
*
* Return: int
*/
int **alloc_grid(int width, int height)
{
int **int_arr, i, j;
if (width <= 0 || height <= 0)
return (NULL);
int_arr = malloc(height * size... | 5 |
Dhiraj7854/Project | 544dd74 | Lab 8-10/MAIN90.c | C | www.github.com/Dhiraj7854/Project/tree/main/Lab 8-10/MAIN90.c | https://raw.githubusercontent.com/Dhiraj7854/Project/544dd74/Lab%208-10/MAIN90.c | Dhiraj7854/Project 544dd74 Lab 8-10/MAIN90.c | true | 200 | 486 | //
// Created by dheeraj on 14/11/24.
//
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char *c = (char *) malloc(500 * sizeof(char));
printf("Enter string: ");
fgets(c,500,stdin);
c[strcspn(c, "\n")] = '\0';
int count=0;
printf("Size with space: %d\n",sizeof(c));
f... | 1 |
A1XP/minishell | d8fc25e | parser/argument.c | C | www.github.com/A1XP/minishell/tree/main/parser/argument.c | https://raw.githubusercontent.com/A1XP/minishell/d8fc25e/parser/argument.c | A1XP/minishell d8fc25e parser/argument.c | true | 200 | 1,943 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* argument.c :+: :+: :+: ... | 4 |
priyanshu-singh-2003/Data-strcuctures | 8a42d9d | ds codes/3_linked_list/singly_reversal.c | C | www.github.com/priyanshu-singh-2003/Data-strcuctures/tree/main/ds codes/3_linked_list/singly_reversal.c | https://raw.githubusercontent.com/priyanshu-singh-2003/Data-strcuctures/8a42d9d/ds%20codes/3_linked_list/singly_reversal.c | priyanshu-singh-2003/Data-strcuctures 8a42d9d ds codes/3_linked_list/singly_reversal.c | true | 200 | 1,577 | #include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *head = NULL;
void insert_end(int d)
{
struct node *temp = (struct node *)malloc(sizeof(struct node));
if (temp == NULL)
{
printf("memory full\n");
return;
}
if ... | 0 |
shivanerathore/C-Classes | 306ac3f | hw4q2.c | C | www.github.com/shivanerathore/C-Classes/tree/main/hw4q2.c | https://raw.githubusercontent.com/shivanerathore/C-Classes/306ac3f/hw4q2.c | shivanerathore/C-Classes 306ac3f hw4q2.c | true | 200 | 1,939 | //Shivane Rathore
//HW4 Question 2
#include <stdio.h>
int main(void) {
//initializing variables
int option;
int managerSal;
int hourSal;
int workedHours;
int overtime;
int otPay;
int salary;
int commSal;
int grossSales;
int pieceSal;
int itemsProd;
int itemPay;
//user input
printf("Manager = 1, Hourly Worker = 2, Co... | 2 |
UBA-code/get_next_line | 56550fc | get_next_line.c | C | www.github.com/UBA-code/get_next_line/tree/main/get_next_line.c | https://raw.githubusercontent.com/UBA-code/get_next_line/56550fc/get_next_line.c | UBA-code/get_next_line 56550fc get_next_line.c | true | 200 | 1,065 | #include "get_next_line.h"
int get_next_line(int fd, char **line)
{
static int counter = 0;
static int i = 0;
static int j = 0;
char txt[BUFER_SIZE];
// check if read success or not
if (read(fd, txt, BUFER_SIZE) == -1)
return (-1);
// loop on txt for the file
while (txt[i])
{
if (txt[i] == ... | 3 |
yousefalideeb/c-programing-homework-1 | 561d08b | question 11.c | C | www.github.com/yousefalideeb/c-programing-homework-1/tree/main/question 11.c | https://raw.githubusercontent.com/yousefalideeb/c-programing-homework-1/561d08b/question%2011.c | yousefalideeb/c-programing-homework-1 561d08b question 11.c | true | 200 | 427 | #include <stdio.h>
int main()
{
int number[10], i, sum = 0;
printf("Enter the 10 numbers:");
for (i = 0; i < 10; i++)
scanf("%d", &number[i]);
printf("the sum and average of 10 numbers is\n");
for (i = 0; i < 10; i++)
{
printf("% ", number[i]);
sum = sum + number[i];
}
printf(" \nThe sum of the 10 numb... | 7 |
sakirmohammad775/Concept-About-C | 47260e0 | S_Sum_of_Consecutive_Odd_Numbers.c | C | www.github.com/sakirmohammad775/Concept-About-C/tree/main/S_Sum_of_Consecutive_Odd_Numbers.c | https://raw.githubusercontent.com/sakirmohammad775/Concept-About-C/47260e0/S_Sum_of_Consecutive_Odd_Numbers.c | sakirmohammad775/Concept-About-C 47260e0 S_Sum_of_Consecutive_Odd_Numbers.c | true | 200 | 933 | /*
Given two numbers X and Y. Print the sum of all odd numbers between them, excluding X and Y.
Input=>
First line contains a number T (1 ≤ T ≤ 10) number of test cases.
Next T lines will contain two numbers X and Y (0 ≤ X, Y ≤ 104).
Output=>
Print the sum of all odd numbers between X and Y (excluding X and Y).
*/
/... | 5 |
20A91A04O3/codemind-c | 2b59cfb | Largest_Digit.c | C | www.github.com/20A91A04O3/codemind-c/tree/main/Largest_Digit.c | https://raw.githubusercontent.com/20A91A04O3/codemind-c/2b59cfb/Largest_Digit.c | 20A91A04O3/codemind-c 2b59cfb Largest_Digit.c | true | 200 | 219 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,r,s1=0;
cin>>n;
while(n>0)
{
r=n%10;
if (r>s1)
{
s1=r;
}
n=n/10;
}
cout<<s1;
}
| 1 |
Vamsikrishna2006/codemind-c | 4a5eb7a | Days_into_years,_weeks:.c | C | www.github.com/Vamsikrishna2006/codemind-c/tree/main/Days_into_years,_weeks:.c | https://raw.githubusercontent.com/Vamsikrishna2006/codemind-c/4a5eb7a/Days_into_years%2C_weeks%3A.c | Vamsikrishna2006/codemind-c 4a5eb7a Days_into_years,_weeks:.c | true | 200 | 151 | #include<stdio.h>
int main()
{
int d,r,y,w;
scanf("%d",&d);
y=d/365;
r=d%365;
scanf("%d",&r);
w=r/7;
printf("%d
%d",y,w);
} | 4 |
Cvostr/kairax | 43fe44b | progs/rxsh/lexer.c | C | www.github.com/Cvostr/kairax/tree/main/progs/rxsh/lexer.c | https://raw.githubusercontent.com/Cvostr/kairax/43fe44b/progs/rxsh/lexer.c | Cvostr/kairax 43fe44b progs/rxsh/lexer.c | true | 200 | 2,736 | #include "lexer.h"
#include "stdlib.h"
#include "ctype.h"
#include "string.h"
char ctrl_chars[] = {'|', '<', '>', '&', ';', '!', '$', '(', ')', '\n'};
int ctrl_chars_size = sizeof(ctrl_chars) / sizeof(char);
int lexer_is_ctrl_char(char c);
int lexer_decode(const char* data, size_t len, struct token** tokens)
{
i... | 0 |
ch-zdd/my-three-kingdom | 93fa60f | src/ccz/app-init.c | C | www.github.com/ch-zdd/my-three-kingdom/tree/main/src/ccz/app-init.c | https://raw.githubusercontent.com/ch-zdd/my-three-kingdom/93fa60f/src/ccz/app-init.c | ch-zdd/my-three-kingdom 93fa60f src/ccz/app-init.c | true | 200 | 1,955 | #include <memory.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include "app-init.h"
#include "../../lib/common.h"
#include "../../lib/data_handle.h"
#include "app-context.h"
#include "app-tui.h"
//int tk_thread_init(void);
//int tk_thread_final(void);
//void task_thread(void* arg);
int set_role(void)... | 2 |
rcook21/Systems-Level_Programming | 55af538 | syslab12.c | C | www.github.com/rcook21/Systems-Level_Programming/tree/main/syslab12.c | https://raw.githubusercontent.com/rcook21/Systems-Level_Programming/55af538/syslab12.c | rcook21/Systems-Level_Programming 55af538 syslab12.c | true | 200 | 2,384 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_STUDENTS 50
#define MAX_SUBJECTS 5
typedef struct {
char name[50];
int rollNo;
float marks[MAX_SUBJECTS];
} Student;
int main() {
int classSize, i, j;
float totalMarks = 0.0, classAverage;
print... | 3 |
vikramkumar1009/Assigment-5 | 86ce00e | table of n.c | C | www.github.com/vikramkumar1009/Assigment-5/tree/main/table of n.c | https://raw.githubusercontent.com/vikramkumar1009/Assigment-5/86ce00e/table%20of%20n.c | vikramkumar1009/Assigment-5 86ce00e table of n.c | true | 200 | 283 | //Write a program to print a table of N.
#include<stdio.h>
main()
{
int i=1,n;
printf("enter value of n to print table\n");
scanf("%d",&n);
printf("table of %d \n",n);
while(i<=10)
{
printf("%d*%d=%d\n",n,i,n*i);
i++;
}
return 0;
}
| 7 |
PATEW/GameboyEmulator | b5c27c7 | include/cart.h | C | www.github.com/PATEW/GameboyEmulator/tree/main/include/cart.h | https://raw.githubusercontent.com/PATEW/GameboyEmulator/b5c27c7/include/cart.h | PATEW/GameboyEmulator b5c27c7 include/cart.h | true | 200 | 399 | #pragma once
#include <common.h>
typedef struct {
u8 entry[4];
u8 logo[0x30];
char title[16];
u16 new_lic_code;
u8 sgb_flag;
u8 type;
u8 rom_size;
u8 ram_size;
u8 dest_code;
u8 lic_code;
u8 version;
u8 checksum;
u16 global_checksum;
} rom_header;
bool cart_load(ch... | 4 |
kakack/crush-in-leetcode | dd2b698 | code/1605-Find Valid Matrix Given Row and Column Sums/1605-Find Valid Matrix Given Row and Column Sums.c | C | www.github.com/kakack/crush-in-leetcode/tree/main/code/1605-Find Valid Matrix Given Row and Column Sums/1605-Find Valid Matrix Given Row and Column Sums.c | https://raw.githubusercontent.com/kakack/crush-in-leetcode/dd2b698/code/1605-Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/1605-Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums.c | kakack/crush-in-leetcode dd2b698 code/1605-Find Valid Matrix Given Row and Column Sums/1605-Find Valid Matrix Given Row and Column Sums.c | true | 200 | 2,094 | // You are given two arrays rowSum and colSum of non-negative integers where rowSum[i] is the sum of the elements in the ith row and colSum[j] is the sum of the elements of the jth column of a 2D matrix. In other words, you do not know the elements of the matrix, but you do know the sums of each row and column.
// Fin... | 1 |
PatrickAtef8/LinuxAdmin | 29610e2 | AdminLinux_Task2/BinarySearch.c | C | www.github.com/PatrickAtef8/LinuxAdmin/tree/main/AdminLinux_Task2/BinarySearch.c | https://raw.githubusercontent.com/PatrickAtef8/LinuxAdmin/29610e2/AdminLinux_Task2/BinarySearch.c | PatrickAtef8/LinuxAdmin 29610e2 AdminLinux_Task2/BinarySearch.c | true | 200 | 1,287 | // C Program to implement binary search
#include <stdio.h>
int binarySearch(int arr[], int left, int right, int key) {
// Loop will run till left > right. It means that there
// are no elements to consider in the given subarray
while (left <= right) {
// calculating mid point
int mid... | 6 |
efrem-upt/AtomC-compiler | 36eabee | tests/testat.c | C | www.github.com/efrem-upt/AtomC-compiler/tree/main/tests/testat.c | https://raw.githubusercontent.com/efrem-upt/AtomC-compiler/36eabee/tests/testat.c | efrem-upt/AtomC-compiler 36eabee tests/testat.c | true | 200 | 206 | struct S{
int n;
char text[16];
};
struct S a;
struct S v[2];
void f(char text[],int i,char ch){
text[i]=1;
}
int h(int x,int y){
if(x>0&&x<y){
f(v[x].text,y,'#');
return 1;
}
return 0;
}
| 0 |
latifa-boudiaf/alx-low_level_programming | e53153c | 0x04-more_functions_nested_loops/8-print_square.c | C | www.github.com/latifa-boudiaf/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/8-print_square.c | https://raw.githubusercontent.com/latifa-boudiaf/alx-low_level_programming/e53153c/0x04-more_functions_nested_loops/8-print_square.c | latifa-boudiaf/alx-low_level_programming e53153c 0x04-more_functions_nested_loops/8-print_square.c | true | 200 | 342 | #include "main.h"
/**
* print_square - Prints a square of a specified size
* @size: The size of the square
*/
void print_square(int size)
{
if (size <= 0)
{
_putchar('\n');
}
else
{
int row, col;
for (row = 0; row < size; row++)
{
for (col = 0; col < size; col++)
{
_putchar('#');
}
_pu... | 3 |
f0ur3y3s/c_snake | 0aca1b2 | include/entity.h | C | www.github.com/f0ur3y3s/c_snake/tree/main/include/entity.h | https://raw.githubusercontent.com/f0ur3y3s/c_snake/0aca1b2/include/entity.h | f0ur3y3s/c_snake 0aca1b2 include/entity.h | true | 200 | 484 | #ifndef ENTITY_H
#define ENTITY_H
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdio.h>
#include "point.h"
typedef enum entity_type_t
{
EMPTY = 0,
PLAYER,
FOOD,
} entity_type_t;
typedef struct entity_t
{
point_t pos;
point_t dir;
int score;
... | 5 |
simedaz/printif | 5d2c102 | fill_oct_array.c | C | www.github.com/simedaz/printif/tree/main/fill_oct_array.c | https://raw.githubusercontent.com/simedaz/printif/5d2c102/fill_oct_array.c | simedaz/printif 5d2c102 fill_oct_array.c | true | 200 | 541 | #include "main.h"
/**
* fill_oct_array - writes the character c to stdout
*
* @bnr: array where is stored the binary.
* @oct: array where is stored the octal.
*
* Return: binary array.
*/
char *fill_oct_array(char *bnr, char *oct)
{
int op, i, j, ioct, limit;
oct[11] = '\0';
for (i = 31, ioct = 10; i >= 0; ... | 7 |
Pmsaa/gtc | 8c98ef6 | application/chassis/chassis_task.h | C | www.github.com/Pmsaa/gtc/tree/main/application/chassis/chassis_task.h | https://raw.githubusercontent.com/Pmsaa/gtc/8c98ef6/application/chassis/chassis_task.h | Pmsaa/gtc 8c98ef6 application/chassis/chassis_task.h | true | 200 | 352 | #ifndef __CHASSIS_TASK_H
#define __CHASSIS_TASK_H
#include "sbus.h"
#include "drv_io.h"
#include "board.h"
#include "sw_ft.h"
#include "caterpillar.h"
#define FOOT_PEDALS_SPEED 0.35
struct chassis
{
struct motor_device motor[2];
struct io_device chassis_io;
};
void chassis_init(void);
void chassis_set_speed(voi... | 4 |
anton-granzow/eti-prak | 363a41f | prak1/src/old/matrix_mul3.c | C | www.github.com/anton-granzow/eti-prak/tree/main/prak1/src/old/matrix_mul3.c | https://raw.githubusercontent.com/anton-granzow/eti-prak/363a41f/prak1/src/old/matrix_mul3.c | anton-granzow/eti-prak 363a41f prak1/src/old/matrix_mul3.c | true | 200 | 2,985 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
const float max_float = 100.0;
int matrix_mul(float **firstMatrix, float **secondMatrix, float **mult, int rowFirst, int columnFirst, int rowSecond, int columnSecond){
int i, j, k;
int counter = 0;
// Initializing elements of matrix mult to 0.
for(i =... | 6 |
touro3/Keep-Threading-Nobody-Explodes | 61a5d12 | src/tedax.h | C | www.github.com/touro3/Keep-Threading-Nobody-Explodes/tree/main/src/tedax.h | https://raw.githubusercontent.com/touro3/Keep-Threading-Nobody-Explodes/61a5d12/src/tedax.h | touro3/Keep-Threading-Nobody-Explodes 61a5d12 src/tedax.h | true | 200 | 366 | #ifndef TEDAX_H
#define TEDAX_H
#include <pthread.h>
#include <semaphore.h>
#define NUM_TEDAX 3
typedef struct {
int id;
int is_available;
pthread_mutex_t lock;
} Tedax;
// Declare tedax_list as a static array
extern Tedax tedax_list[NUM_TEDAX];
void initialize_tedax_list(void);
void cleanup_tedax_list... | 0 |
realrossmanngroup/cbookexercises | 7ba91f3 | ch01/1-09/blank_replacer.c | C | www.github.com/realrossmanngroup/cbookexercises/tree/main/ch01/1-09/blank_replacer.c | https://raw.githubusercontent.com/realrossmanngroup/cbookexercises/7ba91f3/ch01/1-09/blank_replacer.c | realrossmanngroup/cbookexercises 7ba91f3 ch01/1-09/blank_replacer.c | true | 200 | 562 | #include <stdio.h>
void main() {
int c = 0; // Where we store input from keyboard
int blanks = 0; // how we count blanks
while ((c = getchar()) != EOF) {
if (c != ' ') {
putchar(c);
blanks = 0;
} else if (blanks == 0) {
putchar(c);
blanks++;
}
}
}
/*
if c is not a bl... | 1 |
a1fadi/c | 9f952c6 | c-3/vector.c | C | www.github.com/a1fadi/c/tree/main/c-3/vector.c | https://raw.githubusercontent.com/a1fadi/c/9f952c6/c-3/vector.c | a1fadi/c 9f952c6 c-3/vector.c | true | 200 | 369 | // A program to determine vectors
// Fadi Al Hatu
// z5309136 30/09/2021
#include <stdio.h>
struct vector_a;
int x;
int y;
int z;
};
struct vector_b;
int a;
int b;
int c;
};
int main (void) {
printf("Please enter the values of the first vector (x, y, z): "
s... | 3 |
VinayakaGopalaKrishnA123/codemind-c | 4c94655 | Reverse_digits_of_an_integer..c | C | www.github.com/VinayakaGopalaKrishnA123/codemind-c/tree/main/Reverse_digits_of_an_integer..c | https://raw.githubusercontent.com/VinayakaGopalaKrishnA123/codemind-c/4c94655/Reverse_digits_of_an_integer..c | VinayakaGopalaKrishnA123/codemind-c 4c94655 Reverse_digits_of_an_integer..c | true | 200 | 184 | #include<stdio.h>
int main(){
int n,p,pn,d;
scanf("%d",&n);
p=n;
pn=0;
while(p>0){
d=p%10;
pn=pn*10+d;
p=p/10;
}
printf("%d ",pn);
} | 5 |
talenttinaapi/alx-low_level_programming | 07bd46b | 0x13-more_singly_linked_lists/1-listint_len.c | C | www.github.com/talenttinaapi/alx-low_level_programming/tree/main/0x13-more_singly_linked_lists/1-listint_len.c | https://raw.githubusercontent.com/talenttinaapi/alx-low_level_programming/07bd46b/0x13-more_singly_linked_lists/1-listint_len.c | talenttinaapi/alx-low_level_programming 07bd46b 0x13-more_singly_linked_lists/1-listint_len.c | true | 200 | 200 | #include "lists.h"
/**
*listint_len - ...
*@h: ...
*
*Return: num of nodes
*/
size_t listint_len(const listint_t *h)
{
size_t num = 0;
while (h)
{
num++;
h = h->next;
}
return (num);
}
| 7 |
Mayankg-01/c-repository | 8d6cb71 | structure/pokemon.c | C | www.github.com/Mayankg-01/c-repository/tree/main/structure/pokemon.c | https://raw.githubusercontent.com/Mayankg-01/c-repository/8d6cb71/structure/pokemon.c | Mayankg-01/c-repository 8d6cb71 structure/pokemon.c | true | 200 | 719 | #include<stdio.h>
#include<string.h>
int main()
{
typedef struct pokemon{
int hp;
int speed;
int attack;
char tier;
char name[10];
}pokemon;
pokemon arr[2];
strcpy(arr[0].name,"Pikachu");
arr[0].hp=100;
arr[0].speed=150;
arr[0].attack=200;
arr[0].tier='A';
strcpy(arr[1].name,"Me... | 0 |
Raajokiaa-Ritu/operating-system-lab-codes | 4e40f94 | 6.internal fragmentation/internal fragmentation.c | C | www.github.com/Raajokiaa-Ritu/operating-system-lab-codes/tree/main/6.internal fragmentation/internal fragmentation.c | https://raw.githubusercontent.com/Raajokiaa-Ritu/operating-system-lab-codes/4e40f94/6.internal%20fragmentation/internal%20fragmentation.c | Raajokiaa-Ritu/operating-system-lab-codes 4e40f94 6.internal fragmentation/internal fragmentation.c | true | 200 | 3,751 | //-> internal fragmentation->fixed size partion code theke fragment calculate
#include<stdio.h>
int i,j,n,m,e,s;
int value=0,cnt=0,index=0,mn = 999999;
int button;
int partition[105];
int fillup[105];
int process[105];
int allocated[105];
int copy_partition[100];
void take_input()
{
printf("Number of ... | 1 |
ManasTiwari69/dsa | 7261795 | hashing/modulehashfunction.c | C | www.github.com/ManasTiwari69/dsa/tree/main/hashing/modulehashfunction.c | https://raw.githubusercontent.com/ManasTiwari69/dsa/7261795/hashing/modulehashfunction.c | ManasTiwari69/dsa 7261795 hashing/modulehashfunction.c | true | 200 | 838 | //in hashing when usisng modulo hash function take the length of the hash table as prime so as to reduce collisions.
#include<stdio.h>
#define SIZE 10
int Hash(int key)
{
return key%SIZE;
}
void Insert(int H[],int key)
{
int index=Hash(key);
H[index]=key;
}
int Search(int H[],int key)
{
i... | 6 |
Roaa2222/alx-low_level_programming | d9d1538 | 0x0E-structures_typedef/4-new_dog.c | C | www.github.com/Roaa2222/alx-low_level_programming/tree/main/0x0E-structures_typedef/4-new_dog.c | https://raw.githubusercontent.com/Roaa2222/alx-low_level_programming/d9d1538/0x0E-structures_typedef/4-new_dog.c | Roaa2222/alx-low_level_programming d9d1538 0x0E-structures_typedef/4-new_dog.c | true | 200 | 1,361 | #include<stdlib.h>
#include"dog.h"
/**
* _strlen - a function that gets a length of string
*
* @str: the string to get the length
*
* Return: length of @str
*/
int _strlen(const char *str)
{
int length = 0;
while (*str++)
length++;
return (length);
}
/**
* _strcopy - a function that returns @dest with a copy... | 3 |
emmagoke/alx-low_level_programming | 3df145d | 0x14-bit_manipulation/4-clear_bit.c | C | www.github.com/emmagoke/alx-low_level_programming/tree/main/0x14-bit_manipulation/4-clear_bit.c | https://raw.githubusercontent.com/emmagoke/alx-low_level_programming/3df145d/0x14-bit_manipulation/4-clear_bit.c | emmagoke/alx-low_level_programming 3df145d 0x14-bit_manipulation/4-clear_bit.c | true | 200 | 499 | #include "main.h"
/**
* clear_bit - This function sets the value of a bit to 0 at a given index.
* @n: The number whose bit is to be cleared.
* @index: is the index, starting from 0 of the bit you want to set.
* Return: 1 if it worked, or -1 if an error occurred
*/
int clear_bit(unsigned long int *n, unsigned int... | 4 |
jchenstud42/07_minishell | 089a638 | src/libft/get_next_line.c | C | www.github.com/jchenstud42/07_minishell/tree/main/src/libft/get_next_line.c | https://raw.githubusercontent.com/jchenstud42/07_minishell/089a638/src/libft/get_next_line.c | jchenstud42/07_minishell 089a638 src/libft/get_next_line.c | true | 200 | 2,674 | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* get_next_line.c :+: :+: :+... | 7 |
mn-48/CP-Assignment | b333060 | C.c | C | www.github.com/mn-48/CP-Assignment/tree/main/C.c | https://raw.githubusercontent.com/mn-48/CP-Assignment/b333060/C.c | mn-48/CP-Assignment b333060 C.c | true | 200 | 985 | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
void guessNumberGame(int A, int B) {
if (A >= B) {
printf("Invalid range. Ensure A < B.\n");
return;
}
srand(time(NULL));
int target = A + rand() % (B - A + 1);
int guess, tries = 0, maxTries = 10;
while (tries < maxTri... | 0 |
calmsacibis995/uw2-src | 95995ce | usr/src/common/X11R5/uslclients/dtadmin/dashboard/dashboard.c | C | www.github.com/calmsacibis995/uw2-src/tree/main/usr/src/common/X11R5/uslclients/dtadmin/dashboard/dashboard.c | https://raw.githubusercontent.com/calmsacibis995/uw2-src/95995ce/usr/src/common/X11R5/uslclients/dtadmin/dashboard/dashboard.c | calmsacibis995/uw2-src 95995ce usr/src/common/X11R5/uslclients/dtadmin/dashboard/dashboard.c | true | 200 | 41,446 | /* Copyright (c) 1990, 1991, 1992, 1993, 1994 Novell, Inc. All Rights Reserved. */
/* Copyright (c) 1993 Novell, Inc. All Rights Reserved. */
/* All Rights Reserved */
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF Novell Inc. */
/* The copyright notice above does not evidence any */
/* actual or intended pu... | 6 |
Hurray0/elephant-os | 55b7748 | 18.user_process/kernel/main.c | C | www.github.com/Hurray0/elephant-os/tree/main/18.user_process/kernel/main.c | https://raw.githubusercontent.com/Hurray0/elephant-os/55b7748/18.user_process/kernel/main.c | Hurray0/elephant-os 55b7748 18.user_process/kernel/main.c | true | 200 | 1,079 | #include "console.h"
#include "init.h"
#include "interrupt.h"
#include "ioqueue.h"
#include "keyboard.h"
#include "print.h"
#include "process.h"
#include "thread.h"
static void k_thread_a(void *);
static void k_thread_b(void *);
void user_prog_a(void);
void user_prog_b(void);
int test_var_a = 0, test_var_b = 0;
int m... | 1 |
johnstonew/binary_trees | 4bc3c2f | 2-binary_tree_insert_right.c | C | www.github.com/johnstonew/binary_trees/tree/main/2-binary_tree_insert_right.c | https://raw.githubusercontent.com/johnstonew/binary_trees/4bc3c2f/2-binary_tree_insert_right.c | johnstonew/binary_trees 4bc3c2f 2-binary_tree_insert_right.c | true | 200 | 665 | #include "binary_trees.h"
/**
* binary_tree_insert_right - inserts a node as the right-child of another node
* @parent: pointer to the parent of the node tho be created.
* @value: value of the new node.
*
* Return: If error occurs return NULL else pointer of new node
*/
binary_tree_t *binary_tree_insert_right(b... | 7 |
kpatsakis/primevul4 | 2e77de6 | 57684.c | C | www.github.com/kpatsakis/primevul4/tree/main/57684.c | https://raw.githubusercontent.com/kpatsakis/primevul4/2e77de6/57684.c | kpatsakis/primevul4 2e77de6 57684.c | true | 200 | 5,876 | static int check_alu_op(struct bpf_verifier_env *env, struct bpf_insn *insn)
{
struct bpf_reg_state *regs = env->cur_state.regs, *dst_reg;
u8 opcode = BPF_OP(insn->code);
int err;
if (opcode == BPF_END || opcode == BPF_NEG) {
if (opcode == BPF_NEG) {
if (BPF_SRC(insn->code) != 0 ||
insn->src_reg != BPF... | 0 |
Chamour15/alx-low_level_programming | daee1ce | 0x06-pointers_arrays_strings/7-leet.c | C | www.github.com/Chamour15/alx-low_level_programming/tree/main/0x06-pointers_arrays_strings/7-leet.c | https://raw.githubusercontent.com/Chamour15/alx-low_level_programming/daee1ce/0x06-pointers_arrays_strings/7-leet.c | Chamour15/alx-low_level_programming daee1ce 0x06-pointers_arrays_strings/7-leet.c | true | 200 | 527 | #include "main.h"
/**
* leet - function that encodes a string into 1337.
* @strn: string input.
* Return: pointer to strn
*/
char *leet(char *strn)
{
int lenC = 0, i;
int l_letters[] = {97, 101, 111, 116, 108};
int u_letters[] = {65, 69, 79, 84, 76};
int numbers[] = {52, 51, 48, 55, 49};
while (*(strn + lenC)... | 6 |
Ludovic-Lesur/embedded-utils | 2ba99fe | inc/strings.h | C | www.github.com/Ludovic-Lesur/embedded-utils/tree/main/inc/strings.h | https://raw.githubusercontent.com/Ludovic-Lesur/embedded-utils/2ba99fe/inc/strings.h | Ludovic-Lesur/embedded-utils 2ba99fe inc/strings.h | true | 200 | 10,516 | /*
* strings.h
*
* Created on: 05 dec. 2021
* Author: Ludo
*/
#ifndef __STRINGS_H__
#define __STRINGS_H__
#ifndef EMBEDDED_UTILS_DISABLE_FLAGS_FILE
#include "embedded_utils_flags.h"
#endif
#include "error.h"
#include "types.h"
/*** STRING macros ***/
#define STRING_CHAR_NULL '\0'
#define STRING_NULL ... | 1 |
kreofil/ppp-semantic-model | 387a937 | project/tests/test-variable-01/main.c | C | www.github.com/kreofil/ppp-semantic-model/tree/main/project/tests/test-variable-01/main.c | https://raw.githubusercontent.com/kreofil/ppp-semantic-model/387a937/project/tests/test-variable-01/main.c | kreofil/ppp-semantic-model 387a937 project/tests/test-variable-01/main.c | true | 200 | 1,237 | // main.c
#include <stdlib.h>
#include "variable.h"
#include "global.h"
struct Type.Int type01;
struct Constant.Int val01;
int main(int argc, char *argv[]) {
printf("Start\n");
InitTypeInt(&type01);
SetConstantInt(&val01, 10);
Variable* var01 = CreateVariableGlobal((Type*)&type01, (Constant*)&va... | 7 |
anishdakshesh/COMPUTER_NETWORKS | 903d765 | UDPClient.c | C | www.github.com/anishdakshesh/COMPUTER_NETWORKS/tree/main/UDPClient.c | https://raw.githubusercontent.com/anishdakshesh/COMPUTER_NETWORKS/903d765/UDPClient.c | anishdakshesh/COMPUTER_NETWORKS 903d765 UDPClient.c | true | 200 | 1,307 | #include<sys/types.h>
#include<sys/socket.h>
#include<stdio.h>
#include<unistd.h>
#include<string.h>
#include<netinet/in.h>
#include<netdb.h>
int main(int argc,char*argv[])
{
int sd;
char buff[1024];
struct sockaddr_in servaddr;
socklen_t len;
len=sizeof(servaddr);
/*UDP socket is created, an Internet soc... | 0 |
Usool-Data-Science/alx-low_level_programming | 8bddfbf | 0x05-pointers_arrays_strings/5-rev_string.c | C | www.github.com/Usool-Data-Science/alx-low_level_programming/tree/main/0x05-pointers_arrays_strings/5-rev_string.c | https://raw.githubusercontent.com/Usool-Data-Science/alx-low_level_programming/8bddfbf/0x05-pointers_arrays_strings/5-rev_string.c | Usool-Data-Science/alx-low_level_programming 8bddfbf 0x05-pointers_arrays_strings/5-rev_string.c | true | 200 | 348 | #include "main.h"
/**
* rev_string - reverse any string
* @s: the intended string
*
* Return: 0 for successful exit
*/
void rev_string(char *s)
{
char rev = s[0];
int counter = 0;
int i;
while (s[counter] != '\0')
counter++;
for (i = 0; i < counter; i++)
{
counter--;
rev = s[i];
s[i] = s[counter... | 4 |
neve928/ENCE260-LM6 | aa52d86 | q9.c | C | www.github.com/neve928/ENCE260-LM6/tree/main/q9.c | https://raw.githubusercontent.com/neve928/ENCE260-LM6/aa52d86/q9.c | neve928/ENCE260-LM6 aa52d86 q9.c | true | 200 | 861 | #include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include "q9.h"
void deleteElement(LinkedList_t* list, LinkedListElement_t* element)
{
if (element == NULL || list->head == NULL) {
return;
}
if (element == list->head) {
list->head = element->next;
if (list->head == NULL) {... | 6 |
VUEngine/SPONG | 7d9959e | assets/images/OptionsScreen/Spec/OptionsHeaderSpec.c | C | www.github.com/VUEngine/SPONG/tree/main/assets/images/OptionsScreen/Spec/OptionsHeaderSpec.c | https://raw.githubusercontent.com/VUEngine/SPONG/7d9959e/assets/images/OptionsScreen/Spec/OptionsHeaderSpec.c | VUEngine/SPONG 7d9959e assets/images/OptionsScreen/Spec/OptionsHeaderSpec.c | true | 200 | 5,520 | /**
* SPONG
*
* © Jorge Eremiev <jorgech3@gmail.com> and Christian Radke <c.radke@posteo.de>
*
* For the full copyright and license information, please view the LICENSE file
* that was distributed with this source code.
*/
//--------------------------------------------------------------------------------------... | 1 |
Kkyn-ltcode/Raw_code | cca1292 | data/batch_19/1792_0.c | C | www.github.com/Kkyn-ltcode/Raw_code/tree/main/data/batch_19/1792_0.c | https://raw.githubusercontent.com/Kkyn-ltcode/Raw_code/cca1292/data/batch_19/1792_0.c | Kkyn-ltcode/Raw_code cca1292 data/batch_19/1792_0.c | true | 200 | 809 | bool key_changed_h ( connection_t * c ) {
char name [ MAX_STRING_SIZE ] ;
node_t * n ;
if ( sscanf ( c -> buffer , "%*d %*x " MAX_STRING , name ) != 1 ) {
logger ( LOG_ERR , "Got bad %s from %s (%s)" , "KEY_CHANGED" , c -> name , c -> hostname ) ;
return false ;
}
if ( ! check_id ( name ) ) {
logger ( LOG_ERR ,... | 7 |
benshabbat/TutorialsC | f396d78 | tutorial/bits/clear_bit.c | C | www.github.com/benshabbat/TutorialsC/tree/main/tutorial/bits/clear_bit.c | https://raw.githubusercontent.com/benshabbat/TutorialsC/f396d78/tutorial/bits/clear_bit.c | benshabbat/TutorialsC f396d78 tutorial/bits/clear_bit.c | true | 200 | 579 | #include <stdio.h>
#include <stdint.h>
void printbits(int input)
{
int i, mask;
for (i = 31; i >= 0; i--)
{
mask = 1 << i;
if (input & mask)
{
printf("1");
}
else
{
printf("0");
}
}
}
int main()
{
uint8_t num = 0b00011... | 0 |
avengineers/hello-unit-testing | 239c9dc | components/led_hw/src/led_hw.h | C | www.github.com/avengineers/hello-unit-testing/tree/main/components/led_hw/src/led_hw.h | https://raw.githubusercontent.com/avengineers/hello-unit-testing/239c9dc/components/led_hw/src/led_hw.h | avengineers/hello-unit-testing 239c9dc components/led_hw/src/led_hw.h | true | 200 | 366 | #ifndef LED_HW_H
#define LED_HW_H
#include <stdint.h>
typedef struct
{
uint8_t red;
uint8_t green;
uint8_t blue;
} LEDColor;
typedef struct
{
uint8_t brightness;
} LEDBrightness;
/* Set LED color */
extern void setLEDColor(LEDColor color);
/* Set LED brightness */
extern void setLEDBrightness(LEDB... | 6 |
cleancodetdd2/TrainingMaterials | b378ccf | SoftwareBasic/C/Loop/Loop2/nested_loop2.c | C | www.github.com/cleancodetdd2/TrainingMaterials/tree/main/SoftwareBasic/C/Loop/Loop2/nested_loop2.c | https://raw.githubusercontent.com/cleancodetdd2/TrainingMaterials/b378ccf/SoftwareBasic/C/Loop/Loop2/nested_loop2.c | cleancodetdd2/TrainingMaterials b378ccf SoftwareBasic/C/Loop/Loop2/nested_loop2.c | true | 200 | 314 | /*
*
*
*
*
*
*/
#include <stdio.h>
int main_t2()
{
for (int i = 0; i < 5; i++) // �ٱ��� ����. ���� ����
{
for (int j = 0; j < 5; j++) // ���� ����. ���� ����
{
if (j == i)
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
} | 4 |
aq-UI-no/alx-low_level_programming | 39c1c5b | 0x0F-function_pointers/2-int_index.c | C | www.github.com/aq-UI-no/alx-low_level_programming/tree/main/0x0F-function_pointers/2-int_index.c | https://raw.githubusercontent.com/aq-UI-no/alx-low_level_programming/39c1c5b/0x0F-function_pointers/2-int_index.c | aq-UI-no/alx-low_level_programming 39c1c5b 0x0F-function_pointers/2-int_index.c | true | 200 | 458 | #include "function_pointers.h"
#include <stdio.h>
/**
*int_index - searches for an integer
*@size: the number of elements in an array
*@cmp: pointer to function used to compare values
*@array: the array
*
* Return: index of first element
*/
int int_index(int *array, int size, int (*cmp)(int))
{
int i;
if (array... | 1 |
ScottShadow/sorting_algorithms | 7499a74 | 3-quick_sort.c | C | www.github.com/ScottShadow/sorting_algorithms/tree/main/3-quick_sort.c | https://raw.githubusercontent.com/ScottShadow/sorting_algorithms/7499a74/3-quick_sort.c | ScottShadow/sorting_algorithms 7499a74 3-quick_sort.c | true | 200 | 1,823 | #include "sort.h"
#include <stdlib.h>
/**
* swap - Swaps two integers.
* @a: Pointer to the first integer.
* @b: Pointer to the second integer.
* Return: void
*/
void swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void print_array_range(int *array, size_t start, size_t print_size)
{
size_... | 0 |
maqamylee0/printf | 691691a | cpy_bin.c | C | www.github.com/maqamylee0/printf/tree/main/cpy_bin.c | https://raw.githubusercontent.com/maqamylee0/printf/691691a/cpy_bin.c | maqamylee0/printf 691691a cpy_bin.c | true | 200 | 844 | #include "main.h"
/**
* cpy_bin - convert int to binary
* @args: argument list
* @buff: buffer
* @buff_loc: buffer position pointer
* Return: number of chars printed
*/
int cpy_bin(va_list args, char *buff, unsigned long int *buff_loc)
{
int count, len = 0;
unsigned int num_1, num = va_arg(args, int);
char *... | 6 |
Eliraz-Madar/Parking-Lot-Manager | 1e8f362 | ParkingLotManagement/GeneralView.c | C | www.github.com/Eliraz-Madar/Parking-Lot-Manager/tree/main/ParkingLotManagement/GeneralView.c | https://raw.githubusercontent.com/Eliraz-Madar/Parking-Lot-Manager/1e8f362/ParkingLotManagement/GeneralView.c | Eliraz-Madar/Parking-Lot-Manager 1e8f362 ParkingLotManagement/GeneralView.c | true | 200 | 478 | #include "GeneralView.h"
bool getBooleanValueUI(const char* message)
{
int input;
do
{
printf("%s (0 for No, 1 for Yes): ", message);
scanf("%d", &input);
if (input != 0 && input != 1)
{
printf("Invalid input. Please enter 0 for No or 1 for Yes.\n");
}
} while (input != 0 && input != 1)... | 7 |
khaledsoltan95/NTI | ced2d84 | Labs/INTERFACING-PROJECTS/AVR/CounterUsing7SEG/DIO_Cfg.h | C | www.github.com/khaledsoltan95/NTI/tree/main/Labs/INTERFACING-PROJECTS/AVR/CounterUsing7SEG/DIO_Cfg.h | https://raw.githubusercontent.com/khaledsoltan95/NTI/ced2d84/Labs/INTERFACING-PROJECTS/AVR/CounterUsing7SEG/DIO_Cfg.h | khaledsoltan95/NTI ced2d84 Labs/INTERFACING-PROJECTS/AVR/CounterUsing7SEG/DIO_Cfg.h | true | 200 | 2,158 | #ifndef DIO_CFG_H
#define DIO_CFG_H
/* SELECT PORT DIRECTION */
#define PORTAPIN0 INPUT
#define PORTAPIN1 INPUT
#define PORTAPIN2 INPUT
#define PORTAPIN3 INPUT
#define PORTAPIN4 INPUT
#define PORTAPIN5 INPUT
#define PORTAPIN6 INPUT
#define PORTAPIN7 INPUT
#d... | 1 |
Sara-Nagy/AVR_Drivers | e450e1a | MCAL/ADC/ADC_Pravite.h | C | www.github.com/Sara-Nagy/AVR_Drivers/tree/main/MCAL/ADC/ADC_Pravite.h | https://raw.githubusercontent.com/Sara-Nagy/AVR_Drivers/e450e1a/MCAL/ADC/ADC_Pravite.h | Sara-Nagy/AVR_Drivers e450e1a MCAL/ADC/ADC_Pravite.h | true | 200 | 1,682 | /*
* ADC_Pravite.h
*
* Created: 10/8/2021 3:16:30 PM
* Author: Sara Ahmed
*/
#ifndef ADC_PRAVITE_H_
#define ADC_PRAVITE_H_
/*** ADMUX : ADC Multiplexer Selection Register ***/
#define ADMUX *((volatile u8 *)(0x27))
//Bit 7:6 � REFS1:0: Reference Selection Bits
#define REFS1 ... | 4 |
CodeJet3317/C-Programming | a672b9e | Assignment Solutions/064.C | C | www.github.com/CodeJet3317/C-Programming/tree/main/Assignment Solutions/064.C | https://raw.githubusercontent.com/CodeJet3317/C-Programming/a672b9e/Assignment%20Solutions/064.C | CodeJet3317/C-Programming a672b9e Assignment Solutions/064.C | true | 200 | 268 | #include<stdio.h>
#include<conio.h>
void main()
{
int i,j,n,t;
clrscr();
printf("ENTER THE SIZE :");
scanf("%d",&n);
t=1;
for (i=1;i<=n;i++)
{
printf("\n");
for (j=1;j<=i;j++)
{
printf(" %d",t);
t++;
}
}
getch();
} | 0 |
lKenKeil/stack1 | 12d75a6 | stack1/stack1.c | C | www.github.com/lKenKeil/stack1/tree/main/stack1/stack1.c | https://raw.githubusercontent.com/lKenKeil/stack1/12d75a6/stack1/stack1.c | lKenKeil/stack1 12d75a6 stack1/stack1.c | true | 200 | 736 |
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define STACK_SIZE 10
int stack[STACK_SIZE];
int top = -1;
void push(int num) {
if (top == STACK_SIZE - 1) {
printf("Stack Full\n");
return;
}
top++;
stack[top] = num;
printf("Push %d\n", num);
}
int pop() {
if (top ==... | 6 |
mateo-gomez/curso-c | c2f53b3 | curso_algoritmos/recursivida/recursividad.c | C | www.github.com/mateo-gomez/curso-c/tree/main/curso_algoritmos/recursivida/recursividad.c | https://raw.githubusercontent.com/mateo-gomez/curso-c/c2f53b3/curso_algoritmos/recursivida/recursividad.c | mateo-gomez/curso-c c2f53b3 curso_algoritmos/recursivida/recursividad.c | true | 200 | 377 | #include <stdio.h>
#include <stdlib.h>
int buffer;
long result;
long factorial(int n)
{
if (n == 0)
return 1;
return (n * factorial(n - 1));
}
int main(int argc, char const *argv[])
{
printf("Ingresa un número para calcular su valor factorial\n");
scanf("%d", &buffer);
if (buffer > 0)
{
result = factori... | 7 |
Sakshi3333/Methods- | 283469f | program54.c | C | www.github.com/Sakshi3333/Methods-/tree/main/program54.c | https://raw.githubusercontent.com/Sakshi3333/Methods-/283469f/program54.c | Sakshi3333/Methods- 283469f program54.c | true | 200 | 774 | #include<stdio.h>
#include<stdbool.h>
bool CheckPalindrome(int iNo)
{
int iDigit = 0;
int iRev = 0;
int iTemp = 0;
if(iNo > 0)
{
iNo = -iNo;
}
iTemp = iNo;
while(iNo > 0)
{
iDigit = iNo % 10;
iRev = iRev *10 + iDigit;
iNo = ... | 1 |
kpatsakis/primevul3 | f35d800 | 78530.c | C | www.github.com/kpatsakis/primevul3/tree/main/78530.c | https://raw.githubusercontent.com/kpatsakis/primevul3/f35d800/78530.c | kpatsakis/primevul3 f35d800 78530.c | true | 200 | 1,108 | void LineWidth::fitBelowFloats()
{
ASSERT(!m_committedWidth);
ASSERT(!fitsOnLine());
LayoutUnit floatLogicalBottom;
LayoutUnit lastFloatLogicalBottom = m_block->logicalHeight();
float newLineWidth = m_availableWidth;
float newLineLeft = m_left;
float newLineRight = m_right;
while (true)... | 4 |
gim-largerepo/including-investment-59GB | 573884e | modules/peace.c | C | www.github.com/gim-largerepo/including-investment-59GB/tree/main/modules/peace.c | https://raw.githubusercontent.com/gim-largerepo/including-investment-59GB/573884e/modules/peace.c | gim-largerepo/including-investment-59GB 573884e modules/peace.c | true | 200 | 994 | Boy particularly ago may.
Huge prepare several wrong phone force.
Type draw size national office try.
Century none sing fish.
Candidate accept position history.
Make face participant prove.
Learn through get.
Learn it you per.
Help couple quite page important herself.
Air could week east there whatever.
Debate song alo... | 0 |
NXP/rtos-abstraction-layer | ccf7c68 | zephyr/rtos_stdio.c | C | www.github.com/NXP/rtos-abstraction-layer/tree/main/zephyr/rtos_stdio.c | https://raw.githubusercontent.com/NXP/rtos-abstraction-layer/ccf7c68/zephyr/rtos_stdio.c | NXP/rtos-abstraction-layer ccf7c68 zephyr/rtos_stdio.c | true | 200 | 334 | /*
* Copyright 2024 NXP
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#include <zephyr/sys/printk.h>
#include "rtos_stdio.h"
void rtos_printf(const char *fmt_s, ...)
{
va_list ap;
va_start(ap, fmt_s);
vprintk(fmt_s, ap);
va_end(ap);
}
void rtos_vprintf(const char *fmt_s, va_list ap)
{
vprintk... | 2 |
BlackTeji/alx-low_level_programming | 91bde16 | 0x15-file_io/1-create_file.c | C | www.github.com/BlackTeji/alx-low_level_programming/tree/main/0x15-file_io/1-create_file.c | https://raw.githubusercontent.com/BlackTeji/alx-low_level_programming/91bde16/0x15-file_io/1-create_file.c | BlackTeji/alx-low_level_programming 91bde16 0x15-file_io/1-create_file.c | true | 200 | 639 | #include "main.h"
#include <string.h>
/**
* create_file - creates a file.
* @filename: points to the filename.
* @text_content: NULL string to be written to the file.
* Return: 1, when successful. -1, when it fails.
*/
int create_file(const char *filename, char *text_content)
{
int file;
ssize_t wr;
if (file... | 6 |
Charanmaloth/learning_2023 | bad0cf9 | Module1/Day1/Solution9.c | C | www.github.com/Charanmaloth/learning_2023/tree/main/Module1/Day1/Solution9.c | https://raw.githubusercontent.com/Charanmaloth/learning_2023/bad0cf9/Module1/Day1/Solution9.c | Charanmaloth/learning_2023 bad0cf9 Module1/Day1/Solution9.c | true | 200 | 1,140 | #include <stdio.h>
#include <ctype.h>
int findCharType(char c) {
int type;
if (isalpha(c)) {
if (isupper(c)) {
type = 1; // Uppercase letter
} else {
type = 2; // Lowercase letter
}
} else if (isdigit(c)) {
type = 3; // Digit
} else... | 1 |
Sefiamor1606/alx-low_level_programming | 9291470 | 0x04-more_functions_nested_loops/6-print_line.c | C | www.github.com/Sefiamor1606/alx-low_level_programming/tree/main/0x04-more_functions_nested_loops/6-print_line.c | https://raw.githubusercontent.com/Sefiamor1606/alx-low_level_programming/9291470/0x04-more_functions_nested_loops/6-print_line.c | Sefiamor1606/alx-low_level_programming 9291470 0x04-more_functions_nested_loops/6-print_line.c | true | 200 | 543 | #include "main.h"
/**
* print_line - function that draws a straight line in the terminal.
* @n: the number of lines to be drawn
*
* Description: This function draws a straight line in the terminal using the
* character '_'. The number of lines to be drawn is specified by
* the parameter... | 7 |
mariagabrielarpolicarpo/Exerc-cios-em-C | 2f67300 | 6- Vetores e matrizes/l2ex8.c | C | www.github.com/mariagabrielarpolicarpo/Exerc-cios-em-C/tree/main/6- Vetores e matrizes/l2ex8.c | https://raw.githubusercontent.com/mariagabrielarpolicarpo/Exerc-cios-em-C/2f67300/6-%20Vetores%20e%20matrizes/l2ex8.c | mariagabrielarpolicarpo/Exerc-cios-em-C 2f67300 6- Vetores e matrizes/l2ex8.c | true | 200 | 1,800 | #include <stdio.h>
#define M 3
void multiplica(int a[M][M], int b[M][M])
{
int i, i2, i3, soma = 0;
for(i = 0; i<M; i++)
{
for(i2 = 0; i2< M; i2++)
{
for(i3=0; i3<M; i3++)
{
soma = (a[i][i3]*b[i3][i2]) + soma;
}
printf("%d ... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.