封装qsort函数

package qsort

/*

#include <stdlib.h>

typedef int (*qsort_cmp_func_t)

(const void* a, const void* b);

extern int _cgo_qsort_compare(void* a, void* b);

*/

import "C"

import (

	"sync"

	"unsafe"

)

var go_qsort_compare_info struct {

	fn func(a, b unsafe.Pointer) int

	sync.Mutex

}

//export _cgo_qsort_compare

func _cgo_qsort_compare(a, b unsafe.Pointer) C.int {

	return C.int(go_qsort_compare_info.fn(a, b))

}

func Sort(base unsafe.Pointer, num, size int, cmp func(a, b unsafe.Pointer) int) {

	go_qsort_compare_info.Lock()

	defer go_qsort_compare_info.Unlock()

	go_qsort_compare_info.fn = cmp

	C.qsort(base, C.size_t(num), C.size_t(size),

		C.qsort_cmp_func_t(C._cgo_qsort_compare),

	)

}

调用qsort.Sort实现排序

package main

//extern int go_qsort_compare(void* a, void* b);

import "C"

import (

	"fmt"

	"github.com/w3liu/algorithm/books/go-advanced-program/2.6qsort_practice/qsort"

	"unsafe"

)

func main() {

	values := []int32{42, 9, 101, 95, 27, 25}

	qsort.Sort(unsafe.Pointer(&values[0]), len(values),

		int(unsafe.Sizeof(values[0])),

		func(a, b unsafe.Pointer) int {

			pa, pb := (*int32)(a), (*int32)(b)

			return int(*pa - *pb)

		},

	)

	fmt.Println(values)

}

github地址

巴特西

CGO封装C语言qsort函数

封装qsort函数

调用qsort.Sort实现排序

最新文章

热门文章