AlgorithmInC/common.h at master · pisces312/AlgorithmInC · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#ifndef COMMON_H_INCLUDED
#define COMMON_H_INCLUDED

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <assert.h>
#include <memory.h>

#include <iostream>
#include <iomanip>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <stack>
#include <algorithm>
#include <numeric>

//定义打印宏，并在打印信息前加入文件名、行号、函数名
#define PRINTFUNC() \
    printf("<%s>: ",__FUNCTION__)
//此宏展开后，类似于printf("123"),printf("456");
#define TRACE1 (printf("%s(%d)-<%s>: ",__FILE__, __LINE__, __FUNCTION__), printf)

//此宏展开后，类似于printf("%d""%d", 1, 2);
#define TRACE2(fmt,...) \
    printf("%s(%d)-<%s>: "##fmt, __FILE__, __LINE__, __FUNCTION__, ##__VA_ARGS__)

inline void swapInt(int* a,int* b) {
    int tmp=*a;
    *a=*b;
    *b=tmp;
}
//inline void swap(int* x,int i, int j)
//{ int t = x[i];
//  x[i] = x[j];
//  x[j] = t;
//}
inline void swap(int* x,const int i, const int j) {
    int t = x[i];
    x[i] = x[j];
    x[j] = t;
}
void printArray(int*a,int n) ;
void printArray(int*a,int low,int high) ;

/* getbits:  get n bits from position p */
inline unsigned getbits(unsigned x, int p, int n) {
    return (x >> (p+1-n)) & ~(~0 << n);
}
inline int isEven(int n) {
    return !(n&0x1);
}

//template <typename T>
//T** malloc_Array2D(int row, int col);
template <typename T>
T** malloc_Array2D(int row, int col) {
    int size = sizeof(T);
    int point_size = sizeof(T*);
    //先申请内存，其中point_size * row表示存放row个行指针
    T **arr = (T **) malloc(point_size * row + size * row * col);
    if(arr != NULL) {
        memset(arr, 0, point_size * row + size * row * col);
        T *head = (T*)((int)arr + point_size * row);
        while(row--)
            arr[row] = (T*)((int)head + row * col * size);
    }
    return (T**)arr;
}
//释放二维数组
void free_Array2D(void **arr);

inline int compareInt(const void* x,const void* y) {
    return *(int*)x-*(int*)y;
}

void assertSorted(int *x,int n) ;
void createRandomData(int* keys,int n);
void createRandomUniqPostiveData(int* keys,int n);
//template<class T>
//void display(T a[],int n) {
//    for(int i=0; i<n; i++)
//        std::cout<<a[i]<<" ";
//    std::cout<<std::endl;
//}
//template<class T>
//void display(T* a,int n);
//void display(T a[],int n);
#endif // COMMON_H_INCLUDED