remove lf naming scheme
This commit is contained in:
parent
beee62023c
commit
a029765cf4
3
.gitignore
vendored
3
.gitignore
vendored
@ -2,5 +2,4 @@ cmake*
|
||||
.cache
|
||||
build
|
||||
compile_commands.json
|
||||
docs
|
||||
site/
|
||||
site
|
||||
|
@ -6,12 +6,12 @@ set(CMAKE_C_STANDARD 99)
|
||||
include_directories(include)
|
||||
|
||||
set(SOURCES
|
||||
src/lflinkedlist.c
|
||||
src/lfset.c
|
||||
src/lfstack.c
|
||||
src/lfbinarytree.c
|
||||
src/lfinput.c
|
||||
src/lfmath.c
|
||||
src/linkedlist.c
|
||||
src/set.c
|
||||
src/stack.c
|
||||
src/binarytree.c
|
||||
src/input.c
|
||||
src/math.c
|
||||
)
|
||||
|
||||
add_library(flint ${SOURCES})
|
||||
|
@ -1,7 +1,7 @@
|
||||
#ifndef LIBFLINT_H_MATH
|
||||
#define LIBFLINT_H_MATH
|
||||
|
||||
#include "lfutility.h"
|
||||
#include "utility.h"
|
||||
|
||||
int max_int(int a, int b);
|
||||
|
@ -1,7 +1,7 @@
|
||||
#ifndef LIBFLINT_SET_H
|
||||
#define LIBFLINT_SET_H
|
||||
|
||||
#include "lflinkedlist.h"
|
||||
#include "linkedlist.h"
|
||||
|
||||
#define Set List
|
||||
|
@ -1,7 +1,7 @@
|
||||
#ifndef LIBFLINT_STACK_H
|
||||
#define LIBFLINT_STACK_H
|
||||
|
||||
#include "lflinkedlist.h"
|
||||
#include "linkedlist.h"
|
||||
|
||||
#define Stack List
|
||||
|
16
mkdocs.yml
16
mkdocs.yml
@ -5,12 +5,12 @@ theme:
|
||||
nav:
|
||||
- 'index.md'
|
||||
- 'Modules':
|
||||
- 'Boolean': 'lfbool.md'
|
||||
- 'Input': 'lfinput.md'
|
||||
- 'Math': 'lfmath.md'
|
||||
- 'Utility': 'lfutility.md'
|
||||
- 'Boolean': 'bool.md'
|
||||
- 'Input': 'input.md'
|
||||
- 'Math': 'math.md'
|
||||
- 'Utility': 'utility.md'
|
||||
- 'Data Structures':
|
||||
- 'Binary Tree': 'lfbinarytree.md'
|
||||
- 'Linked List': 'lflinkedlist.md'
|
||||
- 'Set': 'lfset.md'
|
||||
- 'Stack': 'lfstack.md'
|
||||
- 'Binary Tree': 'binarytree.md'
|
||||
- 'Linked List': 'linkedlist.md'
|
||||
- 'Set': 'set.md'
|
||||
- 'Stack': 'stack.md'
|
||||
|
@ -2,7 +2,7 @@
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include "lfbinarytree.h"
|
||||
#include "binarytree.h"
|
||||
|
||||
void bintree_init(BinTree *tree, void (*destroy)(void *data)) {
|
||||
tree->size = 0;
|
@ -9,7 +9,7 @@
|
||||
|
||||
#endif
|
||||
|
||||
#include "lfinput.h"
|
||||
#include "input.h"
|
||||
|
||||
static FILE* open_file(const char *path, size_t *fsz) {
|
||||
FILE *fp = NULL;
|
@ -1,7 +1,7 @@
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "lflinkedlist.h"
|
||||
#include "linkedlist.h"
|
||||
|
||||
void ll_init(List *list, void (*destroy)(void *data)) {
|
||||
list->size = 0;
|
@ -1,7 +1,7 @@
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "lfmath.h"
|
||||
#include "math.h"
|
||||
|
||||
int max_int(int a, int b) {
|
||||
if (a > b) {
|
@ -1,4 +1,4 @@
|
||||
#include "lfset.h"
|
||||
#include "set.h"
|
||||
|
||||
void set_init(Set *set, int (*match)(const void *a, const void *b),
|
||||
void (*destroy)(void *data)) {
|
@ -1,4 +1,4 @@
|
||||
#include "lfstack.h"
|
||||
#include "stack.h"
|
||||
|
||||
void stack_init(Stack *stack, void (*destroy)(void *data)) {
|
||||
ll_init(stack, destroy);
|
@ -1,11 +1,11 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "lflinkedlist.h"
|
||||
#include "lfset.h"
|
||||
#include "lfstack.h"
|
||||
#include "lfbinarytree.h"
|
||||
#include "lfmath.h"
|
||||
#include "linkedlist.h"
|
||||
#include "set.h"
|
||||
#include "stack.h"
|
||||
#include "binarytree.h"
|
||||
#include "math.h"
|
||||
|
||||
void print_ll(List *list) {
|
||||
LL_ITER(list) {
|
||||
|
Loading…
x
Reference in New Issue
Block a user