repo_full_name stringlengths 6 93 | repo_url stringlengths 25 112 | repo_api_url stringclasses 28
values | owner stringclasses 28
values | repo_name stringclasses 28
values | description stringclasses 28
values | stars int64 617 98.8k | forks int64 31 355 ⌀ | watchers int64 990 999 ⌀ | license stringclasses 2
values | default_branch stringclasses 2
values | repo_created_at timestamp[s]date 2012-07-24 23:12:50 2025-06-16 08:07:28 ⌀ | repo_updated_at timestamp[s]date 2026-02-23 15:23:15 2026-05-03 18:52:12 ⌀ | repo_topics listlengths 0 13 ⌀ | repo_languages unknown | is_fork bool 1
class | open_issues int64 3 104 ⌀ | file_path stringlengths 3 208 | file_name stringclasses 509
values | file_extension stringclasses 1
value | file_size_bytes int64 101 84k ⌀ | file_url stringclasses 627
values | file_raw_url stringclasses 627
values | file_sha stringclasses 624
values | language stringclasses 8
values | parsed_at stringdate 2026-05-04 01:12:36 2026-05-04 19:41:55 | text stringlengths 100 102k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | build/c_cpp_project_framework/examples/demo1/main/src/test_libposix.c | null | null | null | null | null | null | C | 2026-05-04T18:33:35.601719 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/dummy.c | null | null | null | null | null | null | C | 2026-05-04T18:33:36.459635 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/libavcap.h | null | null | null | null | null | null | C | 2026-05-04T18:33:36.461628 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/test_libavcap.c | null | null | null | null | null | null | C | 2026-05-04T18:33:36.463963 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/dshow.h | null | null | null | null | null | null | C | 2026-05-04T18:33:36.465268 | #ifndef DSHOW_H
#define DSHOW_H
#define COBJMACROS
#define CINTERFACE
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#include <dshow.h>
#include <strmif.h>
#include <dvdmedia.h>
#include <uuids.h>
#include <control.h>
#include <objidl.h>
#include <shlwapi.h>
#include <vfwmsgs.h>
#include <stdint.h>
#include <wchar.h... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/dshow.c | null | null | null | null | null | null | C | 2026-05-04T18:33:36.466603 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/pulseaudio.c | null | null | null | null | null | null | C | 2026-05-04T18:33:36.497887 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/uvc.c | null | null | null | null | null | null | C | 2026-05-04T18:33:37.237038 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/v4l2.c | null | null | null | null | null | null | C | 2026-05-04T18:33:37.267066 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/__fls.h | null | null | null | null | null | null | C | 2026-05-04T18:33:37.911492 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _ASM_GENERIC_BITOPS___FLS_H_
#define _ASM_GENERIC_BITOPS___FLS_H_
#include <asm/types.h>
/**
* __fls - find last (most-significant) set bit in a long word
* @word: the word to search
*
* Undefined if no set bit exists, so code should check against 0 first.
*/
static... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/videocap.h | null | null | null | null | null | null | C | 2026-05-04T18:33:37.912423 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops.h | null | null | null | null | null | null | C | 2026-05-04T18:33:37.913800 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef __TOOLS_ASM_GENERIC_BITOPS_H
#define __TOOLS_ASM_GENERIC_BITOPS_H
/*
* tools/ copied this from include/asm-generic/bitops.h, bit by bit as it needed
* some functions.
*
* For the benefit of those who are trying to port Linux to another
* architecture, here are some C... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/__ffz.h | null | null | null | null | null | null | C | 2026-05-04T18:33:37.915826 | #ifndef _ASM_GENERIC_BITOPS_FFZ_H_
#define _ASM_GENERIC_BITOPS_FFZ_H_
/*
* ffz - find first zero in word.
* @word: The word to search
*
* Undefined if no zero exists, so code should check against ~0UL first.
*/
#define ffz(x) __ffs(~(x))
#endif /* _ASM_GENERIC_BITOPS_FFZ_H_ */
|
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/__ffs.h | null | null | null | null | null | null | C | 2026-05-04T18:33:37.917130 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_ASM_GENERIC_BITOPS___FFS_H_
#define _TOOLS_LINUX_ASM_GENERIC_BITOPS___FFS_H_
#include <asm/types.h>
#include <asm/bitsperlong.h>
/**
* __ffs - find first bit in word.
* @word: The word to search
*
* Undefined if no bit exists, so code should check agains... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/xcbgrab.c | null | null | null | null | null | null | C | 2026-05-04T18:33:37.918427 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/find.h | null | null | null | null | null | null | C | 2026-05-04T18:33:38.546539 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_ASM_GENERIC_BITOPS_FIND_H_
#define _TOOLS_LINUX_ASM_GENERIC_BITOPS_FIND_H_
#ifndef find_next_bit
/**
* find_next_bit - find the next set bit in a memory region
* @addr: The address to base the search on
* @offset: The bitnumber to start searching at
* @si... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/const_hweight.h | null | null | null | null | null | null | C | 2026-05-04T18:33:38.547769 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _ASM_GENERIC_BITOPS_CONST_HWEIGHT_H_
#define _ASM_GENERIC_BITOPS_CONST_HWEIGHT_H_
/*
* Compile time versions of __arch_hweightN()
*/
#define __const_hweight8(w) \
((unsigned int) \
((!!((w) & (1ULL << 0))) + \
(!!((w) & (1ULL << 1))) + \
(!!((w) & (1ULL << 2... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/fls.h | null | null | null | null | null | null | C | 2026-05-04T18:33:38.555920 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _ASM_GENERIC_BITOPS_FLS_H_
#define _ASM_GENERIC_BITOPS_FLS_H_
/**
* fls - find last (most-significant) bit set
* @x: the word to search
*
* This is defined the same way as ffs.
* Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
*/
static __always_inline int fls(i... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/hweight.h | null | null | null | null | null | null | C | 2026-05-04T18:33:38.556444 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_ASM_GENERIC_BITOPS_HWEIGHT_H_
#define _TOOLS_LINUX_ASM_GENERIC_BITOPS_HWEIGHT_H_
#include "asm-generic/bitops/arch_hweight.h"
#include "asm-generic/bitops/const_hweight.h"
#endif /* _TOOLS_LINUX_ASM_GENERIC_BITOPS_HWEIGHT_H_ */
|
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/fls64.h | null | null | null | null | null | null | C | 2026-05-04T18:33:38.585644 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _ASM_GENERIC_BITOPS_FLS64_H_
#define _ASM_GENERIC_BITOPS_FLS64_H_
#include <asm/types.h>
/**
* fls64 - find last set bit in a 64-bit word
* @x: the word to search
*
* This is defined in a similar way as the libc and compiler builtin
* ffsll, but returns the position... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/bitops.h | null | null | null | null | null | null | C | 2026-05-04T18:33:38.586898 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_BITOPS_H_
#define _TOOLS_LINUX_BITOPS_H_
#include <asm/types.h>
#include "kernel.h"
//#include <linux/compiler.h>
typedef __signed__ char __s8;
typedef unsigned char __u8;
typedef __signed__ short __s16;
typedef unsigned short __u16;
typedef __signed__ int ... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/kernel.h | null | null | null | null | null | null | C | 2026-05-04T18:33:39.192292 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _LINUX_KERNEL_H
#define _LINUX_KERNEL_H
#include <stdarg.h>
#include <stddef.h>
#include <assert.h>
//#include <linux/compiler.h>
#include <endian.h>
#include <byteswap.h>
#define USHRT_MAX ((u16)(~0U))
#define SHRT_MAX ((s16)(USHRT_MAX>>1))
#define SHRT_MIN ((s16)(-SH... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/hweight.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.199257 | // SPDX-License-Identifier: GPL-2.0
#include "bitops.h"
#include <asm/types.h>
/**
* hweightN - returns the hamming weight of a N-bit word
* @x: the word to weigh
*
* The Hamming Weight of a number is the total number of bits set in it.
*/
unsigned int __sw_hweight32(unsigned int w)
{
#ifdef CONFIG_ARCH_HAS_FAST... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/libbitmap.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.209397 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libcollections/libcollections.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.236088 | /*
* This file is part of the OpenMV project.
*
* Copyright (c) 2013-2021 Ibrahim Abdelkader <iabdalkader@openmv.io>
* Copyright (c) 2013-2021 Kwabena W. Agyeman <kwagyeman@openmv.io>
*
* This work is licensed under the MIT license, see the file LICENSE for details.
*
* Common data structures.
*/
#include "lib... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/libbitmap.h | null | null | null | null | null | null | C | 2026-05-04T18:33:39.237311 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/test_libbitmap.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.265098 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libcollections/libcollections.h | null | null | null | null | null | null | C | 2026-05-04T18:33:39.848610 | /*
* This file is part of the OpenMV project.
*
* Copyright (c) 2013-2021 Ibrahim Abdelkader <iabdalkader@openmv.io>
* Copyright (c) 2013-2021 Kwabena W. Agyeman <kwagyeman@openmv.io>
*
* This work is licensed under the MIT license, see the file LICENSE for details.
*
* Common data structures.
*/
#ifndef __COL... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/config_util.h | null | null | null | null | null | null | C | 2026-05-04T18:33:39.880709 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libcollections/test_libcollections.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.882178 | /******************************************************************************
* Copyright (C) 2014-2020 dianjixz <18637716021@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/ini/dictionary.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.884275 | /*-------------------------------------------------------------------------*/
/**
@file dictionary.c
@author N. Devillard
@brief Implements a dictionary for string variables.
This module implements a simple dictionary object, i.e. a list
of string/string associations. This object is useful to stor... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/ini/dictionary.h | null | null | null | null | null | null | C | 2026-05-04T18:33:39.903377 |
/*-------------------------------------------------------------------------*/
/**
@file dictionary.h
@author N. Devillard
@brief Implements a dictionary for string variables.
This module implements a simple dictionary object, i.e. a list
of string/string associations. This object is useful to sto... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/ini/ini_config.c | null | null | null | null | null | null | C | 2026-05-04T18:33:39.932983 | /******************************************************************************
* Copyright (C) 2014-2018 Zhifeng Gong <gozfree@163.com>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundat... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/json/cJSON.h | null | null | null | null | null | null | C | 2026-05-04T18:33:40.499071 | /*
Copyright (c) 2009-2017 Dave Gamble and cJSON contributors
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, m... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/ini/iniparser.c | null | null | null | null | null | null | C | 2026-05-04T18:33:40.510220 |
/*-------------------------------------------------------------------------*/
/**
@file iniparser.c
@author N. Devillard
@brief Parser for ini files.
*/
/*--------------------------------------------------------------------------*/
/*---------------------------- Includes --------------------------------... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/ini/iniparser.h | null | null | null | null | null | null | C | 2026-05-04T18:33:40.529039 |
/*-------------------------------------------------------------------------*/
/**
@file iniparser.h
@author N. Devillard
@brief Parser for ini files.
*/
/*--------------------------------------------------------------------------*/
#ifndef INIPARSER_H
#define INIPARSER_H
/*----------------------------... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libconfig/json/cJSON.c | null | null | null | null | null | null | C | 2026-05-04T18:33:40.573994 | /*
Copyright (c) 2009-2017 Dave Gamble and cJSON contributors
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, m... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/atomic.h | null | null | null | null | null | null | C | 2026-05-04T18:33:43.561589 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_ASM_GENERIC_BITOPS_ATOMIC_H_
#define _TOOLS_LINUX_ASM_GENERIC_BITOPS_ATOMIC_H_
#include <asm/types.h>
#include <asm/bitsperlong.h>
static inline void set_bit(int nr, unsigned long *addr)
{
addr[nr / __BITS_PER_LONG] |= 1UL << (nr % __BITS_PER_LONG);
}
stat... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libbitmap/asm-generic/bitops/arch_hweight.h | null | null | null | null | null | null | C | 2026-05-04T18:33:43.590761 | /* SPDX-License-Identifier: GPL-2.0 */
#ifndef _ASM_GENERIC_BITOPS_ARCH_HWEIGHT_H_
#define _ASM_GENERIC_BITOPS_ARCH_HWEIGHT_H_
#include <asm/types.h>
static inline unsigned int __arch_hweight32(unsigned int w)
{
return __sw_hweight32(w);
}
static inline unsigned int __arch_hweight16(unsigned int w)
{
return __sw_h... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/libavcap.c | null | null | null | null | null | null | C | 2026-05-04T18:33:46.113753 | /******************************************************************************
* Copyright (C) 2014-2020 Zhifeng Gong <gozfree@163.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software... |
gozfree/gear-lib | https://github.com/gozfree/gear-lib | null | null | null | null | 3,203 | null | null | mit | null | null | null | null | null | null | null | gear-lib/libavcap/esp32-camera.c | null | null | null | null | null | null | C | 2026-05-04T18:33:46.136571 | #include "libavcap.h"
#include <libthread.h>
#include <liblog.h>
#include <esp_camera.h>
#include <esp_log.h>
#define CONFIG_CAMERA_MODEL_ESP_EYE 1
#if CONFIG_CAMERA_MODEL_ESP_EYE
#define CAMERA_PIN_PWDN -1
#define CAMERA_PIN_RESET -1
#define CAMERA_PIN_SIOD 18
#define CAMERA_PIN_SIOC 23
#define CAMERA_PIN... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/list.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.464269 | /**
@file list.h
@brief ENet list management
*/
#ifndef __ENET_LIST_H__
#define __ENET_LIST_H__
#include <stdlib.h>
typedef struct _ENetListNode
{
struct _ENetListNode * next;
struct _ENetListNode * previous;
} ENetListNode;
typedef ENetListNode * ENetListIterator;
typedef struct _ENetList
{
ENetListN... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | callbacks.c | null | null | null | null | null | null | C | 2026-05-04T18:33:48.467155 | /**
@file callbacks.c
@brief ENet callback functions
*/
#define ENET_BUILDING_LIB 1
#include "enet/enet.h"
static ENetCallbacks callbacks = { malloc, free, abort };
int
enet_initialize_with_callbacks (ENetVersion version, const ENetCallbacks * inits)
{
if (version < ENET_VERSION_CREATE (1, 3, 0))
return -1... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | compress.c | null | null | null | null | null | null | C | 2026-05-04T18:33:48.468604 | /**
@file compress.c
@brief An adaptive order-2 PPM range coder
*/
#define ENET_BUILDING_LIB 1
#include <string.h>
#include "enet/enet.h"
typedef struct _ENetSymbol
{
/* binary indexed tree of symbols */
enet_uint8 value;
enet_uint8 count;
enet_uint16 under;
enet_uint16 left, right;
/* cont... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | host.c | null | null | null | null | null | null | C | 2026-05-04T18:33:48.471772 | /**
@file host.c
@brief ENet host management functions
*/
#define ENET_BUILDING_LIB 1
#include <string.h>
#include "enet/enet.h"
/** @defgroup host ENet host functions
@{
*/
/** Creates a host for communicating to peers.
@param address the address at which other peers may connect to this host. If NUL... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/protocol.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.476284 | /**
@file protocol.h
@brief ENet protocol
*/
#ifndef __ENET_PROTOCOL_H__
#define __ENET_PROTOCOL_H__
#include "enet/types.h"
enum
{
ENET_PROTOCOL_MINIMUM_MTU = 576,
ENET_PROTOCOL_MAXIMUM_MTU = 4096,
ENET_PROTOCOL_MAXIMUM_PACKET_COMMANDS = 32,
ENET_PROTOCOL_MINIMUM_WINDOW_SIZE ... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/types.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.477932 | /**
@file types.h
@brief type definitions for ENet
*/
#ifndef __ENET_TYPES_H__
#define __ENET_TYPES_H__
typedef unsigned char enet_uint8; /**< unsigned 8-bit type */
typedef unsigned short enet_uint16; /**< unsigned 16-bit type */
typedef unsigned int enet_uint32; /**< unsigned 32-bit type */
#end... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/unix.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.484425 | /**
@file unix.h
@brief ENet Unix header
*/
#ifndef __ENET_UNIX_H__
#define __ENET_UNIX_H__
#include <stdlib.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#include <unistd.h>
#ifdef MSG_MAXIOVLEN
#define ENET_BUFFER_MAXIMUM MSG_MAXIOVLEN
#en... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/callbacks.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.488569 | /**
@file callbacks.h
@brief ENet callbacks
*/
#ifndef __ENET_CALLBACKS_H__
#define __ENET_CALLBACKS_H__
#include <stdlib.h>
typedef struct _ENetCallbacks
{
void * (ENET_CALLBACK * malloc) (size_t size);
void (ENET_CALLBACK * free) (void * memory);
void (ENET_CALLBACK * no_memory) (void);
} ENetCallba... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/enet.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.492453 | /**
@file enet.h
@brief ENet public header file
*/
#ifndef __ENET_ENET_H__
#define __ENET_ENET_H__
#include <stdlib.h>
#ifdef _WIN32
#include "enet/win32.h"
#else
#include "enet/unix.h"
#endif
#include "enet/types.h"
#include "enet/protocol.h"
#include "enet/list.h"
#include "enet/callbacks.h"
#define ENET_VERS... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/time.h | null | null | null | null | null | null | C | 2026-05-04T18:33:48.494486 | /**
@file time.h
@brief ENet time constants and macros
*/
#ifndef __ENET_TIME_H__
#define __ENET_TIME_H__
#define ENET_TIME_OVERFLOW 86400000
#define ENET_TIME_LESS(a, b) ((a) - (b) >= ENET_TIME_OVERFLOW)
#define ENET_TIME_GREATER(a, b) ((b) - (a) >= ENET_TIME_OVERFLOW)
#define ENET_TIME_LESS_EQUAL(a, b) (! ENET_... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/win32.h | null | null | null | null | null | null | C | 2026-05-04T18:33:49.051466 | /**
@file win32.h
@brief ENet Win32 header
*/
#ifndef __ENET_WIN32_H__
#define __ENET_WIN32_H__
#ifdef _MSC_VER
#ifdef ENET_BUILDING_LIB
#pragma warning (disable: 4267) // size_t to int conversion
#pragma warning (disable: 4244) // 64bit to 32bit int
#pragma warning (disable: 4018) // signed/unsigned mismatch
#pra... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | protocol.c | null | null | null | null | null | null | C | 2026-05-04T18:33:49.089517 | /**
@file protocol.c
@brief ENet protocol functions
*/
#include <stdio.h>
#include <string.h>
#define ENET_BUILDING_LIB 1
#include "enet/utility.h"
#include "enet/time.h"
#include "enet/enet.h"
static const size_t commandSizes [ENET_PROTOCOL_COMMAND_COUNT] =
{
0,
sizeof (ENetProtocolAcknowledge),
sizeo... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | list.c | null | null | null | null | null | null | C | 2026-05-04T18:33:49.115643 | /**
@file list.c
@brief ENet linked list functions
*/
#define ENET_BUILDING_LIB 1
#include "enet/enet.h"
/**
@defgroup list ENet linked list utility functions
@ingroup private
@{
*/
void
enet_list_clear (ENetList * list)
{
list -> sentinel.next = & list -> sentinel;
list -> sentinel.previous = & ... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | win32.c | null | null | null | null | null | null | C | 2026-05-04T18:33:49.134335 | /**
@file win32.c
@brief ENet Win32 system specific functions
*/
#ifdef _WIN32
#define ENET_BUILDING_LIB 1
#include "enet/enet.h"
#include <windows.h>
#include <mmsystem.h>
#include <ws2tcpip.h>
static enet_uint32 timeBase = 0;
int
enet_initialize (void)
{
WORD versionRequested = MAKEWORD (1, 1);
WSADATA... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | include/enet/utility.h | null | null | null | null | null | null | C | 2026-05-04T18:33:49.134825 | /**
@file utility.h
@brief ENet utility header
*/
#ifndef __ENET_UTILITY_H__
#define __ENET_UTILITY_H__
#ifdef HAS_OFFSETOF
#include <stddef.h>
#endif
#define ENET_MAX(x, y) ((x) > (y) ? (x) : (y))
#define ENET_MIN(x, y) ((x) < (y) ? (x) : (y))
#define ENET_DIFFERENCE(x, y) ((x) < (y) ? (y) - (x) : (x) - (y))
#i... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | peer.c | null | null | null | null | null | null | C | 2026-05-04T18:33:49.137429 | /**
@file peer.c
@brief ENet peer management functions
*/
#include <string.h>
#define ENET_BUILDING_LIB 1
#include "enet/utility.h"
#include "enet/enet.h"
/** @defgroup peer ENet peer functions
@{
*/
/** Configures throttle parameter for a peer.
Unreliable packets are dropped by ENet in response to the ... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | unix.c | null | null | null | null | null | null | C | 2026-05-04T18:33:49.144638 | /**
@file unix.c
@brief ENet Unix system specific functions
*/
#ifndef _WIN32
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <sys/time.h>
#include <netinet/tcp.h>
#include <netdb.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <time.h>
#define ENET_BUILDING_L... |
lsalzman/enet | https://github.com/lsalzman/enet | null | null | null | null | 3,191 | null | null | mit | null | null | null | null | null | null | null | packet.c | null | null | null | null | null | null | C | 2026-05-04T18:33:49.202031 | /**
@file packet.c
@brief ENet packet management functions
*/
#include <string.h>
#define ENET_BUILDING_LIB 1
#include "enet/enet.h"
/** @defgroup Packet ENet packet functions
@{
*/
/** Creates a packet that may be sent to a peer.
@param data initial contents of the packet's data; the packet's d... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0009_palindrome_number/palindrome_number.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.228257 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
static int reverse(int x)
{
int n = 0;
while (x != 0) {
int r = x % 10;
/* Checking the over/underflow. */
if (n > INT_MAX / 10 || (n == INT_MAX / 10 && r > 7)) {
return 0;
}
if (n < INT_MIN / 10 ||... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0002_add_two_numbers/add_two_numbers.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.265060 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* Definition for singly-linked list. */
struct ListNode {
int val;
struct ListNode *next;
};
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2)
{
int carry = 0;
struct ListNode dummy;
struct ListNode *p = l1, *prev ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0007_reverse_integer/reverse_integer.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.266216 | #include <stdio.h>
#include <stdlib.h>
#include <limits.h>
static int reverse(int x)
{
int n = 0;
while (x != 0) {
int r = x % 10;
/* Checking the over/underflow. */
if (n > INT_MAX / 10 || (n == INT_MAX / 10 && r > 7)) {
return 0;
}
if (n < INT_MIN / 10 || ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0010_regular_expression_matching/regular_expression.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.268128 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
static bool isMatch(char *s, char *p)
{
if (*p == '\0') {
return *s == '\0';
}
bool first_match = (*s != '\0') && (*s == *p || *p == '.');
if (p[1] == '*') {
return isMatch(s, p + 2) || (first_match && isMatch(s + 1, p));
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0006_zigzag_conversion/zigzag_conversion.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.269047 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static char* convert(char* s, int numRows)
{
if (numRows <= 1) return s;
int len = strlen(s);
char *new_str = malloc(len + 1);
char *p = new_str;
int row = 0;
for (row = 0; row < numRows; row++) {
int interval1 = numRows + ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0003_longest_substring_without_repeat/longest_substring_without_repeat.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.270403 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int lengthOfLongestSubstring(char *s)
{
int count[256] = {0};
int len = 0;
int i, j;
for (i = 0, j = 0; s[i] != '\0'; i++) {
count[s[i]]++;
while (count[s[i]] > 1) {
len = i - j > len ? i - j : len;
cou... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0008_atoi/atoi.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.278674 | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
static int myAtoi(char* str)
{
char *s;
long n = 0;
int sign = 0;
while (*str == ' ' || *str == '\t') {
str++;
}
if (*str == '-') {
if (isdigit(*++str)) {
sign = 1;
} else {
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0001_two_sum/two_sum.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.279184 | #include <stdio.h>
#include <stdlib.h>
struct object {
int val;
int index;
};
static int compare(const void *a, const void *b)
{
return ((struct object *) a)->val - ((struct object *) b)->val;
}
int * twosum(int *nums, int numsSize, int target, int *returnSize)
{
int i, j;
struct object *objs = ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0004_median_of_two_sorted_array/median_of_two_sorted_array.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.308543 | #include <stdio.h>
#include <stdlib.h>
static double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size)
{
int sum = nums1Size + nums2Size;
int *nums = malloc(sizeof(int) * sum);
int i = 0, j = 0, k = 0;
int half = sum / 2 + 1;
while (k < half) {
int n;
if (... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0005_longest_palindromic_substring/longest_palindromic_substring.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.309545 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
static int manacher(char *s, char output[])
{
int i, j;
char s2[3000] = { '\0' };
s2[0] = '$';
for (i = 0; s[i] != '\0'; i++) {
s2[(i<<1)+1] = '#';
s2[(i<<1)+2]... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0011_container_with_most_water/container.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.857494 | #include <stdio.h>
#include <stdlib.h>
static int maxArea(int* height, int heightSize)
{
int min = 0, max = heightSize - 1;
int area_max = 0;
while (min < max) {
int area = (max - min) * (height[min] < height[max] ? height[min] : height[max]);
area_max = area > area_max ? area : area_max;
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0014_longest_common_prefix/common_prefix.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.913500 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
static char* longestCommonPrefix(char** strs, int strsSize)
{
if (strsSize == 0) {
return "";
}
int i, count = 0;
char *result = malloc(1000);
while (strs[0][count] != '\0') {
char c = strs[0][count];
for (i = 1; ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0013_roman_to_integer/roman_to_integer.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.936204 | #include <stdio.h>
#include <stdlib.h>
static int roman_to_integer(char c)
{
switch(c) {
case 'I':
return 1;
case 'V':
return 5;
case 'X':
return 10;
case 'L':
return 50;
case 'C':
return 100;
case 'D':
return 500;
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0012_roman_numeral/roman_numeral.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.936762 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static void num2char(char **num, int bit, int n)
{
int i;
char low, mid, high;
char *p = *num;
switch (n) {
case 2:
low = 'C';
mid = 'D';
high = 'M';
break;
case 1:
low = 'X';
mid = 'L';
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0015_three_sum/three_sum.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.959151 | #include <stdio.h>
#include <stdlib.h>
static int compare(const void *a, const void *b)
{
return *(int *) a - *(int *) b;
}
static void two_sum(int *nums, int low, int high, int target, int **results, int *count)
{
while (low < high) {
int sum = nums[low] + nums[high];
if (sum < target) {
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0017_letter_combinations_of_a_phone_number/letter_combinations.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.960295 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
/**
** Return an array of size *returnSize.
** Note: The returned array must be malloced, assume caller calls free().
**/
static char** letterCombinations(char* digits, int* returnSize)
{
int i, j, k;
int empty = 1;
int count = 1;
int digit_... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0019_remove_nth_node_from_end_of_list/remove_end.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.970572 | #include <stdio.h>
#include <stdlib.h>
struct ListNode {
int val;
struct ListNode *next;
};
static struct ListNode* removeNthFromEnd(struct ListNode* head, int n)
{
if (n == 0) {
return NULL;
}
struct ListNode *p, *prev, dummy;
dummy.next = head;
p = prev = &dummy;
while (n--... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0016_three_sum_closest/three_sum_closest.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.971819 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <limits.h>
static int compare(const void *a, const void *b)
{
return *(int *) a - *(int *) b;
}
static int threeSumClosest(int* nums, int numsSize, int target)
{
int i, min_diff = INT_MAX;
if (numsSize < 3) {
return min_diff;
}... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0018_four_sum/four_sum.c | null | null | null | null | null | null | C | 2026-05-04T18:33:56.988533 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static int compare(const void *a, const void *b)
{
return *(int *) a - *(int *) b;
}
static void k_sum(int *nums, int low, int high, long target, int total, int k,
int *stack, int len, int **results, int *count)
{
int i;
if (k ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0020_valid_parentheses/valid_parentheses.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.027470 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
static bool isValid(char *s)
{
int n = 0;
char stack[100];
while (*s != '\0') {
switch(*s) {
case '(':
case '[':
case '{':
stack[n++] = *s;
break;
case ')':
if (n == 0 ||... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0022_generate_parathesis/parenthesis.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.749828 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static void dfs(int n, int left, int right, char *stack, int len, char **results, int *count)
{
if (len == 2 * n) {
results[*count] = malloc((len + 1) * sizeof(char));
strcpy(results[(*count)++], stack);
return;
}
if (left ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0026_remove_duplicates_from_sorted_array/rm_dup.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.751090 | #include <stdio.h>
#include <stdlib.h>
static int removeDuplicates(int* nums, int numsSize)
{
int i, size = 0;
for (i = 1; i < numsSize; i++) {
if (nums[size] != nums[i]) {
nums[++size] = nums[i];
}
}
return size + 1;
}
int main(int argc, char **argv)
{
int i, size = ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0021_merge_two_sorted_lists/merge_lists.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.753869 | #include <stdio.h>
#include <stdlib.h>
struct ListNode {
int val;
struct ListNode *next;
};
static struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
{
struct ListNode dummy;
struct ListNode *tail = &dummy;
while (l1 != NULL && l2 != NULL) {
if (l1->val <= l2->val) {... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0025_reverse_nodes_in_k_group/reverse_nodes.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.755153 | #include <stdio.h>
#include <stdlib.h>
struct ListNode {
int val;
struct ListNode *next;
};
static struct ListNode* reverseKGroup(struct ListNode* head, int k)
{
int len = 0;
struct ListNode dummy;
struct ListNode *prev = &dummy;
dummy.next = head;
for (; head != NULL; head = head->next) {... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0023_merge_k_sorted_lists/merge_lists.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.756494 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode {
int val;
struct ListNode *next;
};
static inline void swap(struct ListNode **a, struct ListNode **b)
{
struct ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0024_swap_nodes_in_pairs/swap_nodes.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.757387 | #include <stdio.h>
#include <stdlib.h>
struct ListNode {
int val;
struct ListNode *next;
};
static struct ListNode* swapPairs(struct ListNode* head)
{
if (head == NULL) {
return NULL;
}
struct ListNode dummy;
dummy.next = head;
struct ListNode *prev = &dummy;
struct ListNode *p... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0029_divide_two_integers/divide.c | null | null | null | null | null | null | C | 2026-05-04T18:33:57.758267 | #include <stdio.h>
#include <stdlib.h>
#include <limits.h>
int divide(int dividend, int divisor)
{
int signal = 1;
unsigned int dvd = dividend;
if (dividend < 0) {
signal *= -1;
dvd = ~dvd + 1;
}
unsigned int dvs = divisor;
if (divisor < 0) {
signal *= -1;
dvs =... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0027_remove_element/rm_elem.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.322428 | #include <stdio.h>
#include <stdlib.h>
int removeElement(int *nums, int numsSize, int val)
{
int i, count = 0;
for (i = 0; i < numsSize; i++) {
if (nums[i] != val) {
nums[count++] = nums[i];
}
}
return count;
}
int main(int argc, char **argv)
{
int i;
int *nums = m... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0030_substring_with_concatenation_of_all_words/concatenation.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.324214 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#define container_of(ptr, type, member) \
((type *)((char *)(ptr) - (size_t)&(((type *)0)->member)))
#define list_entry(ptr, type, member) \
container_of(ptr, type, member)
#define list_for_each_entry(pos, head, member) \
fo... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0035_search_insert_position/insert_position.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.764852 | #include <stdio.h>
#include <stdlib.h>
static int searchInsert(int* nums, int numsSize, int target)
{
int low = -1;
int high = numsSize;
while (low + 1 < high) {
int mid = low + (high - low) / 2;
if (target > nums[mid]) {
low = mid;
} else {
high = mid;
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0037_sudoku_solver/sudoku_solver.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.766636 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
static bool valid(int num, int row, int col, int index,
bool **rows, bool **cols, bool **boxes)
{
return !rows[row][num] && !cols[col][num] && !boxes[index][num];
}
static bool dfs(char** board, int size, bool **rows... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0036_valid_sudoku/valid_sudoku.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.837337 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
static bool valid(char **board, char *mark, int i, int j) {
if (board[i][j] != '.') {
int index = board[i][j] - '0';
if (mark[index]) {
return false;
} else {
mark[index] = 1;
}
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0038_count_and_say/count_and_say.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.946436 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static void parse(char *input, char *output)
{
char *p = input;
char *q = output;
while (*p != '\0') {
int count = 1;
while (p[0] == p[1]) {
count++;
p++;
}
/* reverse number */
int ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0039_combination_sum/combination_sum.c | null | null | null | null | null | null | C | 2026-05-04T18:33:58.999509 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static void dfs(int *nums, int size, int start, int target, int *stack,
int len, int **results, int *count, int *column_sizes)
{
int i;
if (target < 0) {
return;
} else if (target == 0) {
results[*count] = malloc(le... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0028_implement_strstr/strstr.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.309680 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#if 0
int strStr(char *haystack, char *needle)
{
if (haystack == NULL || needle == NULL) {
return -1;
}
int hlen = strlen(haystack);
int nlen = strlen(needle);
/* haystack < needle */
if (hlen < nlen) {
return -1;
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0040_combination_sum_ii/combination_sum.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.391670 | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
static int compare(const void *a, const void *b)
{
return *(int *) a - *(int *) b;
}
static void dfs(int *nums, int size, int start, int target, int *solution,
int len, int **results, int *count, i... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0041_first_missing_positive/missing_positive.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.411223 | #include <stdio.h>
#include <stdlib.h>
static inline void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
static int firstMissingPositive(int* nums, int numsSize)
{
if (numsSize == 0) {
return 1;
}
int i = 0;
while (i < numsSize) {
/* nums[i] should be i+1 and nu... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0042_trapping_rain_water/trap_water.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.476713 | #include <stdio.h>
#include <stdlib.h>
#if 0
static int trap(int* height, int heightSize)
{
int i, res = 0;
int *lmax = malloc(heightSize * sizeof(int));
int *rmax = malloc(heightSize * sizeof(int));
lmax[0] = height[0];
rmax[heightSize - 1] = height[heightSize - 1];
for (i = 1; i < heightSiz... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0043_multiply_strings/multiply_strings.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.579467 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
static char* multiply(char* num1, char* num2)
{
if (*num1 == '\0') {
return num1;
}
if (*num2 == '\0') {
return num2;
}
int i, j;
int len1 = strlen(num1);
int len2 = strlen(num2);
char *result = malloc(len1 + ... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0044_wildcard_matching/wildcard_matching.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.629567 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
static bool isMatch(char* s, char* p)
{
char *last_s = NULL;
char *last_p = NULL;
while (*s != '\0') {
if (*p == '*') {
/* skip the '*', and mark a flag */
if (*++p == '\0') {
... |
begeekmyfriend/leetcode | https://github.com/begeekmyfriend/leetcode | null | null | null | null | 3,167 | null | null | mit | null | null | null | null | null | null | null | 0045_jump_game_ii/jump_game.c | null | null | null | null | null | null | C | 2026-05-04T18:33:59.905510 | #include <stdio.h>
#include <stdlib.h>
static inline int max(int a, int b)
{
return a > b ? a : b;
}
static int jump(int* nums, int numsSize)
{
int i, right = 0;
int steps = 0;
int fartest = 0;
/* 1. Exhaust all the right boundries in the location range of [i...farthest]
* 2. When i reaches ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.