C 错误:应为声明说明符或‘’;在‘之前;lessthen\u\t?
遵循本教程: 我有以下错误:C 错误:应为声明说明符或‘’;在‘之前;lessthen\u\t?,c,C,遵循本教程: 我有以下错误: source/ordered_array.c: In function ‘insert_ordered_array’: source/ordered_array.c:43:67: error: expected identifier before ‘[’ token source/ordered_array.c:43:67: error: too few arguments to function ‘array->less_than’ make: *** [
source/ordered_array.c: In function ‘insert_ordered_array’:
source/ordered_array.c:43:67: error: expected identifier before ‘[’ token
source/ordered_array.c:43:67: error: too few arguments to function ‘array->less_than’
make: *** [obj/ordered_array.o] Error 1
从我的编译器。我没有得到任何它,因为我已经完全遵循了教程
以下是相关文件:
有序_数组.h:
// ordered_array.h -- Interface for creating, inserting and deleting
// from ordered arrays.
// Written for JamesM's kernel development tutorials.
#ifndef ORDERED_ARRAY_H
#define ORDERED_ARRAY_H
#include "common.h"
/**
This array is insertion sorted - it always remains in a sorted state (between calls).
It can store anything that can be cast to a void* -- so a u32int, or any pointer.
**/
typedef void* type_t;
/**
A predicate should return nonzero if the first argument is less than the second. Else
it should return zero.
**/
typedef s8int (*lessthan_predicate_t)(type_t,type_t);
typedef struct
{
type_t *array;
u32int size;
u32int max_size;
lessthan_predicate_t less_than;
} ordered_array_t;
/**
A standard less than predicate.
**/
s8int standard_lessthan_predicate(type_t a, type_t b);
/**
Create an ordered array.
**/
ordered_array_t create_ordered_array(u32int max_size, lessthan_predicate_t less_than);
ordered_array_t place_ordered_array(void *addr, u32int max_size, lessthan_predicate_t less_than);
/**
Destroy an ordered array.
**/
void destroy_ordered_array(ordered_array_t *array);
/**
Add an item into the array.
**/
void insert_ordered_array(type_t item, ordered_array_t *array);
/**
Lookup the item at index i.
**/
type_t lookup_ordered_array(u32int i, ordered_array_t *array);
/**
Deletes the item at location i from the array.
**/
void remove_ordered_array(u32int i, ordered_array_t *array);
#endif // ORDERED_ARRAY_H
有序数组。c:
// ordered_array.c -- Implementation for creating, inserting and deleting
// from ordered arrays.
// Written for JamesM's kernel development tutorials.
#include "ordered_array.h"
s8int standard_lessthan_predicate ( type_t a, type_t b )
{
return ( a < b ) ? 1:0;
}
ordered_array_t create_ordered_array ( u32int max_size, lessthan_predicate_t less_than )
{
ordered_array_t to_ret;
to_ret.array = ( void* ) kmalloc ( max_size * sizeof ( type_t ) ) ;
memset ( to_ret.array, 0, max_size*sizeof ( type_t ) );
to_ret.size = 0;
to_ret.max_size = max_size;
to_ret.less_than = less_than;
return to_ret;
}
ordered_array_t place_ordered_array ( void *addr, u32int max_size, lessthan_predicate_t less_than )
{
ordered_array_t to_ret;
to_ret.array = ( type_t *) addr;
memset ( to_ret.array, 0, max_size*sizeof ( type_t ) );
to_ret.size = 0;
to_ret.max_size = max_size;
to_ret.less_than = less_than;
return to_ret;
}
void destroy_ordered_array ( ordered_array_t *array )
{
// kfree ( array -> array );
}
void insert_ordered_array ( type_t item, ordered_array_t *array )
{
ASSERT ( array -> less_than );
u32int iterator = 0;
---------------------------------------Faulting Line------------------------------------
while ( iterator < array -> size && array -> less_than ( array ->[iterator], item ) )
----------------------------------------------------------------------------------------
iterator++;
if ( iterator == array -> size ) // just add at the end of the array.
array -> array [array -> size++] = item;
else
{
type_t tmp = array -> array[iterator];
array -> array[iterator] = item;
while ( iterator < array -> size )
{
iterator++;
type_t tmp2 = array -> array[iterator];
array -> array[iterator] = tmp;
tmp = tmp2;
}
array -> size++;
}
}
type_t lookup_order_array ( u32int i, ordered_array_t *array )
{
ASSERT ( i < array -> size );
return array -> array [i];
}
void remove_ordered_array ( u32int i, ordered_array_t *array )
{
while ( i < array -> size )
{
array -> array[i] = array -> array[i+1];
i++;
}
array -> size--;
}
//ordered_array.c——创建、插入和删除的实现
//从有序数组。
//为JamesM的内核开发教程编写。
#包括“ordered_array.h”
s8int标准谓词(类型a,类型b)
{
返回值(a数组);
}
void insert_ordered_数组(类型\u t item,ordered_数组\u t*数组)
{
断言(数组->小于);
u32int迭代器=0;
---------------------------------------断层线------------------------------------
而(迭代器<数组->大小和数组->小于(数组->迭代器],项))
----------------------------------------------------------------------------------------
迭代器++;
if(迭代器==数组->大小)//只需在数组末尾添加。
数组->数组[数组->大小+]=项;
其他的
{
键入\u t tmp=array->array[iterator];
数组->数组[迭代器]=项;
while(迭代器size)
{
迭代器++;
键入\u t tmp2=数组->数组[迭代器];
数组->数组[迭代器]=tmp;
tmp=tmp2;
}
数组->大小++;
}
}
键入查找顺序数组(u32int i,有序数组*数组)
{
断言(isize);
返回数组->数组[i];
}
void remove_ordered_数组(u32int i,ordered_数组_t*数组)
{
而(isize)
{
数组->数组[i]=数组->数组[i+1];
i++;
}
数组->大小--;
}
知道我为什么会出现编译错误吗?
less\u可预测的\u t
在任何地方都没有定义
array->[iterator]
错误。大概应该是array->array[iterator]
?在将lessten\u predictable\u t更改为lessthan\u predicate\u t之后,我有了一个新的错误列表,虽然这次更小,有什么想法吗?这看起来很奇怪:array->[iterator],->和[?你认为这是在做什么?用断层线更新了OP。你注意到的“错误”在哪里?