From da4d127cbd65c35fee03411df66eadd34e7a999b Mon Sep 17 00:00:00 2001 From: Tyge Løvset Date: Fri, 17 Jul 2020 11:51:07 +0200 Subject: Renamed chash.h to cmap.h and added cset.h --- examples/advanced.c | 2 +- examples/benchmark.c | 6 +++--- examples/complex.c | 8 ++++---- examples/demos.c | 10 +++++----- examples/geek1.c | 2 +- examples/geek2.c | 2 +- examples/geek3.c | 2 +- examples/geek4.c | 2 +- examples/geek5.c | 2 +- examples/geek6.c | 2 +- examples/mapmap.c | 2 +- examples/rngtest.c | 2 +- 12 files changed, 21 insertions(+), 21 deletions(-) (limited to 'examples') diff --git a/examples/advanced.c b/examples/advanced.c index e6b4ad2a..bd06c95d 100644 --- a/examples/advanced.c +++ b/examples/advanced.c @@ -11,7 +11,7 @@ * of the Viking struct first. */ #include -#include +#include #include // Viking view struct ----------------------- diff --git a/examples/benchmark.c b/examples/benchmark.c index 31b36b1a..cadb220c 100644 --- a/examples/benchmark.c +++ b/examples/benchmark.c @@ -1,6 +1,6 @@ -#include "../stc/crandom.h" -#include "../stc/cstr.h" -#include "../stc/chash.h" +#include +#include +#include #include "others/khash.h" #include diff --git a/examples/complex.c b/examples/complex.c index feb01db2..6cfed90c 100644 --- a/examples/complex.c +++ b/examples/complex.c @@ -1,7 +1,7 @@ -#include "../stc/cstr.h" -#include "../stc/chash.h" -#include "../stc/clist.h" -#include "../stc/carray.h" +#include +#include +#include +#include void check_destroy(float* v) {printf("destroy %g\n", *v);} diff --git a/examples/demos.c b/examples/demos.c index 037983e0..c10cace9 100644 --- a/examples/demos.c +++ b/examples/demos.c @@ -1,8 +1,8 @@ -#include "../stc/cvec.h" -#include "../stc/clist.h" -#include "../stc/carray.h" -#include "../stc/chash.h" -#include "../stc/cstr.h" +#include +#include +#include +#include +#include void stringdemo1() diff --git a/examples/geek1.c b/examples/geek1.c index 2aecaa8d..a8cf5b7b 100644 --- a/examples/geek1.c +++ b/examples/geek1.c @@ -10,7 +10,7 @@ int a[] = { 1, 2, 2, 3, 2, 4, 10 }; #ifndef __cplusplus // C program to implement the above approach #include -#include +#include declare_CMap(ii, int, int); diff --git a/examples/geek2.c b/examples/geek2.c index 7ce4fd2d..38916243 100644 --- a/examples/geek2.c +++ b/examples/geek2.c @@ -1,6 +1,6 @@ #ifndef __cplusplus -#include +#include #include declare_CMap_str(ss, CStr, cstr_destroy); diff --git a/examples/geek3.c b/examples/geek3.c index 4db84d13..3ea93fe5 100644 --- a/examples/geek3.c +++ b/examples/geek3.c @@ -1,6 +1,6 @@ // xx3.c -#include +#include #include declare_CMap_str(si, int); diff --git a/examples/geek4.c b/examples/geek4.c index 3f0f7f79..243301f9 100644 --- a/examples/geek4.c +++ b/examples/geek4.c @@ -33,7 +33,7 @@ Efficient Approach: For all the words of the first sentence, we can check if it #ifndef __cplusplus // C implementation of the approach -#include +#include #include #include diff --git a/examples/geek5.c b/examples/geek5.c index 0af114b7..2dbd0adb 100644 --- a/examples/geek5.c +++ b/examples/geek5.c @@ -17,7 +17,7 @@ Output: 0 #ifndef __cplusplus -#include +#include #include #include diff --git a/examples/geek6.c b/examples/geek6.c index 369867e9..ef86c3e8 100644 --- a/examples/geek6.c +++ b/examples/geek6.c @@ -29,7 +29,7 @@ operation in almost O(1) time complexity. // positive missing number #include -#include +#include declare_CSet(i, int); // Function to find the smallest positive diff --git a/examples/mapmap.c b/examples/mapmap.c index 77c71fe9..35b5f510 100644 --- a/examples/mapmap.c +++ b/examples/mapmap.c @@ -1,6 +1,6 @@ #include -#include +#include static void test_destr(int* x) { printf("destroy int: %d\n", *x); diff --git a/examples/rngtest.c b/examples/rngtest.c index ed3bed08..c465b5c3 100644 --- a/examples/rngtest.c +++ b/examples/rngtest.c @@ -1,6 +1,6 @@ #include #include -#include "../stc/crandom.h" +#include #ifdef __cplusplus #include #endif -- cgit v1.2.3