remove lf naming scheme

This commit is contained in:
Evan Burkey 2023-07-12 11:32:21 -07:00
parent beee62023c
commit a029765cf4
26 changed files with 29 additions and 30 deletions

3
.gitignore vendored
View File

@ -2,5 +2,4 @@ cmake*
.cache .cache
build build
compile_commands.json compile_commands.json
docs site
site/

View File

@ -6,12 +6,12 @@ set(CMAKE_C_STANDARD 99)
include_directories(include) include_directories(include)
set(SOURCES set(SOURCES
src/lflinkedlist.c src/linkedlist.c
src/lfset.c src/set.c
src/lfstack.c src/stack.c
src/lfbinarytree.c src/binarytree.c
src/lfinput.c src/input.c
src/lfmath.c src/math.c
) )
add_library(flint ${SOURCES}) add_library(flint ${SOURCES})

View File

@ -1,7 +1,7 @@
#ifndef LIBFLINT_H_MATH #ifndef LIBFLINT_H_MATH
#define LIBFLINT_H_MATH #define LIBFLINT_H_MATH
#include "lfutility.h" #include "utility.h"
int max_int(int a, int b); int max_int(int a, int b);

View File

@ -1,7 +1,7 @@
#ifndef LIBFLINT_SET_H #ifndef LIBFLINT_SET_H
#define LIBFLINT_SET_H #define LIBFLINT_SET_H
#include "lflinkedlist.h" #include "linkedlist.h"
#define Set List #define Set List

View File

@ -1,7 +1,7 @@
#ifndef LIBFLINT_STACK_H #ifndef LIBFLINT_STACK_H
#define LIBFLINT_STACK_H #define LIBFLINT_STACK_H
#include "lflinkedlist.h" #include "linkedlist.h"
#define Stack List #define Stack List

View File

@ -5,12 +5,12 @@ theme:
nav: nav:
- 'index.md' - 'index.md'
- 'Modules': - 'Modules':
- 'Boolean': 'lfbool.md' - 'Boolean': 'bool.md'
- 'Input': 'lfinput.md' - 'Input': 'input.md'
- 'Math': 'lfmath.md' - 'Math': 'math.md'
- 'Utility': 'lfutility.md' - 'Utility': 'utility.md'
- 'Data Structures': - 'Data Structures':
- 'Binary Tree': 'lfbinarytree.md' - 'Binary Tree': 'binarytree.md'
- 'Linked List': 'lflinkedlist.md' - 'Linked List': 'linkedlist.md'
- 'Set': 'lfset.md' - 'Set': 'set.md'
- 'Stack': 'lfstack.md' - 'Stack': 'stack.md'

View File

@ -2,7 +2,7 @@
#include <string.h> #include <string.h>
#include <stdio.h> #include <stdio.h>
#include "lfbinarytree.h" #include "binarytree.h"
void bintree_init(BinTree *tree, void (*destroy)(void *data)) { void bintree_init(BinTree *tree, void (*destroy)(void *data)) {
tree->size = 0; tree->size = 0;

View File

@ -9,7 +9,7 @@
#endif #endif
#include "lfinput.h" #include "input.h"
static FILE* open_file(const char *path, size_t *fsz) { static FILE* open_file(const char *path, size_t *fsz) {
FILE *fp = NULL; FILE *fp = NULL;

View File

@ -1,7 +1,7 @@
#include <string.h> #include <string.h>
#include <stdlib.h> #include <stdlib.h>
#include "lflinkedlist.h" #include "linkedlist.h"
void ll_init(List *list, void (*destroy)(void *data)) { void ll_init(List *list, void (*destroy)(void *data)) {
list->size = 0; list->size = 0;

View File

@ -1,7 +1,7 @@
#include <string.h> #include <string.h>
#include <stdlib.h> #include <stdlib.h>
#include "lfmath.h" #include "math.h"
int max_int(int a, int b) { int max_int(int a, int b) {
if (a > b) { if (a > b) {

View File

@ -1,4 +1,4 @@
#include "lfset.h" #include "set.h"
void set_init(Set *set, int (*match)(const void *a, const void *b), void set_init(Set *set, int (*match)(const void *a, const void *b),
void (*destroy)(void *data)) { void (*destroy)(void *data)) {

View File

@ -1,4 +1,4 @@
#include "lfstack.h" #include "stack.h"
void stack_init(Stack *stack, void (*destroy)(void *data)) { void stack_init(Stack *stack, void (*destroy)(void *data)) {
ll_init(stack, destroy); ll_init(stack, destroy);

View File

@ -1,11 +1,11 @@
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include "lflinkedlist.h" #include "linkedlist.h"
#include "lfset.h" #include "set.h"
#include "lfstack.h" #include "stack.h"
#include "lfbinarytree.h" #include "binarytree.h"
#include "lfmath.h" #include "math.h"
void print_ll(List *list) { void print_ll(List *list) {
LL_ITER(list) { LL_ITER(list) {