r/cprogramming

For my thesis I had to read a lot of big CSV files in C and I couldn't really find a parser I wanted to use. The main C one is LGPL and comes with a whole build system, and everything else I found was C++. So I ended up writing my own. Now that im done with the thesis i cleaned it up properly , seperated it from the rest of the thesis code, and decided to standalone push it on GitHub.

It's one file. You copy csv.h into your project and that's it, nothing to link, no dependencies. It doesn't allocate memory, the fields just point into your own buffer, and you can run through files of any size a chunk at a time.

Honestly I spent way more time testing it than writing it. It passes csv-spectrum and I compared the output against Python's csv module on a few thousand files/

Check it out here -> https://github.com/GeorgeKiritsis/Csv.h

If someone has time to look at the API and tell me what could change or be imrpoved, that would help a lot. Thanks a lot in advance

grm: telegram CLI that is Human and AI friendly repos:

• https://gitlab.com/renich/grm
• https://github.com/renich/grm (mirror)

Features:

• Dual Human/AI UX Engine: Optimized both for interactive terminal use (ANSI TTY tables, color schemes) and automated AI agent workflows (JSON envelope, NDJSON streams).

• Native TDLib Engine: Direct C++ bindings to libtdjson for zero-hallucination, full MTProto protocol fidelity.

• Supergroup & Forum Topic First: Complete lifecycle management for Telegram Supergroups, Forum Topics, custom emoji icons, and thread messages.

• File Upload & Download Engine: Streamlined document, photo, video, and media extractions with MIME detection and progress tracking.

• Shell Tab Auto-Completion: Context-aware Bash tab completion covering commands, subcommands, flags, and options.

• Telegram Rich Text & Emoji Customization: Telegram Markdown V2 entity formatting and custom Supergroup topic emoji icons.

• FreeDesktop & XDG Compliant: Strictly honors FreeDesktop standards for user binaries, man pages, shell completions, and session state.

Im just having fun with it. I have a roadmap so check it out. I'll see how much time I can dedicate to this one.

It's already pretty cool, at least for me. The --filter and --since options are killers.

It's pre alpha stuff. Use it under your own peril.

I had to compile my own libtdjson and put it in ~/.local/lib:

$ ldd ~/.local/bin/grm 
	linux-vdso.so.1 (0x00007f69897ba000)
	libtdjson.so.1.8.0 => /home/someuser/.local/lib/libtdjson.so.1.8.0 (0x00007f6987400000)
	libjson-c.so.5 => /lib64/libjson-c.so.5 (0x00007f698976b000)
	libstdc++.so.6 => /lib64/libstdc++.so.6 (0x00007f6987000000)
	libm.so.6 => /lib64/libm.so.6 (0x00007f69872e9000)
	libgcc_s.so.1 => /lib64/libgcc_s.so.1 (0x00007f698973e000)
	libc.so.6 => /lib64/libc.so.6 (0x00007f6986e07000)
	libssl.so.3 => /lib64/libssl.so.3 (0x00007f6986d0e000)
	libcrypto.so.3 => /lib64/libcrypto.so.3 (0x00007f6986600000)
	libz.so.1 => /lib64/libz.so.1 (0x00007f6989712000)
	/lib64/ld-linux-x86-64.so.2 (0x00007f69897bc000)

Login works at least... sometimes. ;D

Demo:

$ time grm chat ls
CHAT ID              TYPE            TITLE                          UNREAD
---------------------------------------------------------------------------
-1003950065700       Supergroup      Domadores Digitales            0
-1002549279967       Supergroup      EVALinux Bar!                  0
-1002312480906       Supergroup      NorTK                          0
-1002289735000       Supergroup      EVALinux                       0
-1003981300643       Supergroup      (expert) creations             1
-1001623037840       Supergroup      Linux En Español               9
-1002527874209       Supergroup      Fundación MxOS                 0
-1001981848857       Supergroup      NubeMX                         0
-1003679369169       Supergroup      Hyper Muscles & Boobs Heaven   36
8911035898           Private Chat    Abastero                       0
-467666877           Basic Group     Proyectos 1101                 0
-1003596396470       Supergroup      1101 SOPORTE VALLEJO           0
-1001371756065       Supergroup      Fedora Linux                   3
6943468991           Private Chat    Doris Marian Jiménez Beltrán   0
777000               Private Chat    Telegram                       0
-1001127772209       Supergroup      DeviantArt                     0
-1001382463627       Supergroup      Team Offtopic buscando popularidad en el barrio del baneado 0
-1002234007248       Supergroup      Naomilk 🐰🔞                   0
-1001100311770       Supergroup      Fedora México                  0
-1001789902965       Supergroup      Los Bonitos                    1

real	0m0.063s
user	0m0.047s
sys	0m0.030s

$ time grm msg ls --filter='@renich' --limit=2 --since='3 years ago' -1001100311770
(2023-08-16T00:39:26Z) <@renichbon> : Ah, un comando para resetear todas mis configuraciones de GNOME:
                                      
                                      dconf reset -f /
                                      
                                      
                                      Úselo bajo su propio riesgo.
(2023-08-26T23:26:58Z) <@renichbon> : OpenTF Foundation
                                      https://opentf.org/announcement
real	0m0.484s
user	0m0.045s
sys	0m0.025s

real	0m0.484s
user	0m0.045s
sys	0m0.025s

Hey everyone,

I put together a video on Dynamic Memory Allocation in C++ — part of an OOP series I'm building for people prepping for interviews/DSA who want solid fundamentals, not just surface-level definitions.

Covers:

• Stack vs Heap — the real differences, not just textbook definitions
• Why taking array size as user input on the Stack is a bad idea (and often breaks across compilers)
• How new actually allocates on the Heap at runtime
• Why you need a pointer on the Stack to access Heap data
• Using delete properly to avoid memory leaks

I tried to explain the "why" behind these concepts since most tutorials just show syntax without explaining what's actually happening in memory.

Link: https://youtu.be/JxrYh3xUF54

Would love feedback — anything unclear, anything you'd want covered next in the series (constructors/destructors, virtual functions, etc.), or just general thoughts. Not trying to spam, genuinely want to make this series useful.

Thanks!

Ask questions across your Markdown notes using a fully local Graph RAG engine. Built for Obsidian vaults, works with any folder of Markdown files. Extracts entity-relation triples from wikilinks & YAML frontmatter, retrieves answers via hybrid search (vector + BM25 + temporal). Multilingual. No cloud. Runs on Ollama.

https://github.com/benmaster82/Kwipu

I am preparing for DSA, and I find it difficult to debug arrays inside a function. When I enter the function in the debugger, I can only see the starting address and the value of the first array element. I am not able to see the other array values. What is the right way to debug this, and how should I write the program to make debugging easier?

This is sort01 code fro example:

debugging image : [debug.png](https://postimg.cc/JGfZ8jrd)

#include <stdio.h>
#include <stdlib.h>

void sort01(int *array, int n)
{
    int tmp=0;
    int left=0;
    int right=n-1;
    while(left <= right)
    {
        if(array[left] !=0)
        {
tmp = array[left];
array[left]= array[right];
array[right]=tmp;
right--;
        }
        else
        {
            left++;
        }
    }
}
int main()
{
int array[]={1,0,1,1,1,0,0,1,0};
int n=sizeof(array)/sizeof(array[0]);
sort01(array, n);
for( int i=0 ;i<n ; i++)
printf( "%d",array[i]);
return 0;
}

Hi. For the past few weeks I've been crafting my generic hash table implementation:

https://github.com/andrzejs-gh/ghtable

I realize it's not the fastest out there and isn't the most cache friendly, but that was never my priority as I prioritized flexibility and genericness.

If anyone's interested take a look ;)

PS.

Do recruiters even care about projects like this nowadays, or would they rather see huge vibecoded codebases on candidate's gh as a proof that they can deliver?

Hey everyone,

I wanted to share a project I've been building: HexaCore, a lightweight memory scanner and tool built from scratch using C++ and the Win32 API.

Key Features:

• Multi-level pointer chain resolver & scanner
• Array of Bytes (AOB) scanning with wildcard support
• Built-in Hex Viewer, basic Disassembler, and NOP/Patch tool
• Custom dark UI with card-based panels and adjustable freezing intervals
• Cheat table save/load system

It's open-source. I'd love to hear your feedback or suggestions for the V1 version!

GitHub / Source Code: https://github.com/abuzit/HexaCore-Memory-Tool

D.eSystem 6.1.0 introduces a small setup and you can choose your UI with D.eSystem 6.1.0.

D.eSystem 6.1.0 on github: https://github.com/D-electronics-scratch/all_D.eSystem_versions/releases/tag/v.6.1.0

All current D.eSystem releases on github: https://github.com/D-electronics-scratch/all_D.eSystem_versions/tags