- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
我在编译我的 tldlist.c 文件时遇到问题。
我如何解决这些问题:
请忽略未使用的变量/参数警告。我还没有实现一些方法。
注意:不能以任何方式修改 tldlist.h。
编译器错误:
bash-3.2$ gcc -c -W -Wall tldlist.c
tldlist.c:86:21: warning: implicit declaration of function 'tldnode_create' is invalid in C99 [-Wimplicit-function-declaration]
TLDNode *node = tldnode_create(tld_name);
^
tldlist.c:86:14: warning: incompatible integer to pointer conversion initializing 'TLDNode *' (aka 'struct tldnode *') with an expression of
type 'int' [-Wint-conversion]
TLDNode *node = tldnode_create(tld_name);
^ ~~~~~~~~~~~~~~~~~~~~~~~~
tldlist.c:92:10: warning: implicit declaration of function 'tldlist_add_node' is invalid in C99 [-Wimplicit-function-declaration]
if (!tldlist_add_node(tld, tld_name, tld->root))
^
tldlist.c:71:7: warning: unused variable 'comparison' [-Wunused-variable]
int comparison;
^
tldlist.c:110:12: error: static declaration of 'tldlist_add_node' follows non-static declaration
static int tldlist_add_node(TLDList *tld, char *tld_name, TLDNode *node) {
^
tldlist.c:92:10: note: previous implicit declaration is here
if (!tldlist_add_node(tld, tld_name, tld->root))
^
tldlist.c:121:14: warning: incompatible integer to pointer conversion initializing 'TLDNode *' (aka 'struct tldnode *') with an expression of
type 'int' [-Wint-conversion]
TLDNode *new = tldnode_create(tld_name);
^ ~~~~~~~~~~~~~~~~~~~~~~~~
tldlist.c:128:14: warning: incompatible integer to pointer conversion initializing 'TLDNode *' (aka 'struct tldnode *') with an expression of
type 'int' [-Wint-conversion]
TLDNode *new = tldnode_create(tld_name);
^ ~~~~~~~~~~~~~~~~~~~~~~~~
tldlist.c:151:43: warning: unused parameter 'tld' [-Wunused-parameter]
TLDIterator *tldlist_iter_create(TLDList *tld) {
^
tldlist.c:159:41: warning: unused parameter 'iter' [-Wunused-parameter]
TLDNode *tldlist_iter_next(TLDIterator *iter) {
^
tldlist.c:174:10: error: conflicting types for 'tldnode_create'
TLDNode *tldnode_create(char *element) {
^
tldlist.c:86:21: note: previous implicit declaration is here
TLDNode *node = tldnode_create(tld_name);
^
8 warnings and 2 errors generated.
tldlist.c:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "date.h"
#include "tldlist.h"
struct tldlist {
struct tldnode *root;
long count;
long size;
Date *begin;
Date *end;
};
/*
* TODO: check the definition of element.
*/
struct tldnode {
struct tldnode *parent;
struct tldnode *left;
struct tldnode *right;
char *element;
long count;
};
/*
* TODO: look at lecture slides
*/
struct tlditerator {
struct tldlist *tld;
};
/*
* tldlist_create generates a list structure for storing counts against
* top level domains (TLDs)
*
* creates a TLDList that is constrained to the `begin' and `end' Date's
* returns a pointer to the list if successful, NULL if not
*/
TLDList *tldlist_create(Date *begin, Date *end) {
TLDList *tldl = (TLDList *)malloc(sizeof(TLDList));
if (tldl != NULL) {
tldl->root = NULL;
tldl->count = 0;
tldl->begin = date_duplicate(begin);
tldl->end = date_duplicate(end);
}
return tldl;
};
/*
* tldlist_destroy destroys the list structure in `tld'
*
* all heap allocated storage associated with the list is returned to the heap
*/
void tldlist_destroy(TLDList *tld) {
if (tld != NULL)
free(tld);
};
/*
* tldlist_add adds the TLD contained in `hostname' to the tldlist if
* `d' falls in the begin and end dates associated with the list;
* returns 1 if the entry was counted, 0 if not
*/
int tldlist_add(TLDList *tld, char *hostname, Date *d) {
char *tld_capture;
char *tld_name;
int tld_length;
int comparison;
// check if 'd' in the date range
if (date_compare(tld->begin, d) > 0 || date_compare(tld->end, d) < 0)
return 0;
// get TLD from hostname
tld_capture = strrchr(hostname, '.') + 1;
tld_length = strlen(tld_capture);
tld_name = (char *)malloc(sizeof(char)*(tld_length+1));
tld_name[tld_length] = '\0';
strcpy(tld_name, tld_capture);
if (tld->root == NULL) {
/* insert at root */
TLDNode *node = tldnode_create(tld_name);
node->count++;
tld->root = node;
tld->size++;
} else {
/* add elsewhere */
if (!tldlist_add_node(tld, tld_name, tld->root))
free(tld_name);
else
tld->size++;
}
return 0;
};
/*
* insert the TLD to the tree
* consider 5 different cases:
* (1) TLD name < current and there is a left node
* (2) TLD name > current and there is a right node
* (3) TLD name < current and there is no left node
* (4) TLD name > current and there is no right node
* (5) TLD name is equal to current
*/
static int tldlist_add_node(TLDList *tld, char *tld_name, TLDNode *node) {
int comparison = strcmp(tld_name, node->element);
if ((comparison < 0) && (node->left != NULL))
/* case 1 */
return tldlist_add_node(tld, tld_name, node->left);
else if ((comparison > 0) && (node->right != NULL))
/* case 2 */
return tldlist_add_node(tld, tld_name, node->right);
else if ((comparison < 0) && (node->left == NULL)) {
/* case 3 */
TLDNode *new = tldnode_create(tld_name);
new->parent = node;
new->count++;
node->left = new;
return 1;
} else if ((comparison > 0) && (node->right == NULL)) {
/* case 4 */
TLDNode *new = tldnode_create(tld_name);
new->parent = node;
new->count++;
node->right = new;
return 1;
} else {
/* case 5 */
node->count++;
return 0;
}
}
/*
* tldlist_count returns the number of successful tldlist_add() calls since
* the creation of the TLDList
*/
long tldlist_count(TLDList *tld) {
return tld->count;
};
/*
* tldlist_iter_create creates an iterator over the TLDList; returns a pointer
* to the iterator if successful, NULL if not
*/
TLDIterator *tldlist_iter_create(TLDList *tld) {
return NULL;
};
/*
* tldlist_iter_next returns the next element in the list; returns a pointer
* to the TLDNode if successful, NULL if no more elements to return
*/
TLDNode *tldlist_iter_next(TLDIterator *iter) {
return NULL;
};
/*
* tldlist_iter_destroy destroys the iterator specified by `iter'
*/
void tldlist_iter_destroy(TLDIterator *iter) {
free(iter);
};
/*
* tldnode_create() creates a new node that contains a TLD name
* returns a pointer to the node if successful, NULL if not
*/
TLDNode *tldnode_create(char *element) {
TLDNode *node = (TLDNode *)malloc(sizeof(TLDNode));
if (node != NULL) {
node->parent = NULL;
node->left = NULL;
node->right = NULL;
node->count = 0;
}
return node;
}
/*
* tldnode_tldname returns the tld associated with the TLDNode
*/
char *tldnode_tldname(TLDNode *node) {
return node->element;
};
/*
* tldnode_count returns the number of times that a log entry for the
* corresponding tld was added to the list
*/
long tldnode_count(TLDNode *node) {
return node->count;
};
tldlist.h:
#ifndef _TLDLIST_H_INCLUDED_
#define _TLDLIST_H_INCLUDED_
#include "date.h"
typedef struct tldlist TLDList;
typedef struct tldnode TLDNode;
typedef struct tlditerator TLDIterator;
/*
* tldlist_create generates a list structure for storing counts against
* top level domains (TLDs)
*
* creates a TLDList that is constrained to the `begin' and `end' Date's
* returns a pointer to the list if successful, NULL if not
*/
TLDList *tldlist_create(Date *begin, Date *end);
/*
* tldlist_destroy destroys the list structure in `tld'
*
* all heap allocated storage associated with the list is returned to the heap
*/
void tldlist_destroy(TLDList *tld);
/*
* tldlist_add adds the TLD contained in `hostname' to the tldlist if
* `d' falls in the begin and end dates associated with the list;
* returns 1 if the entry was counted, 0 if not
*/
int tldlist_add(TLDList *tld, char *hostname, Date *d);
/*
* tldlist_count returns the number of successful tldlist_add() calls since
* the creation of the TLDList
*/
long tldlist_count(TLDList *tld);
/*
* tldlist_iter_create creates an iterator over the TLDList; returns a pointer
* to the iterator if successful, NULL if not
*/
TLDIterator *tldlist_iter_create(TLDList *tld);
/*
* tldlist_iter_next returns the next element in the list; returns a pointer
* to the TLDNode if successful, NULL if no more elements to return
*/
TLDNode *tldlist_iter_next(TLDIterator *iter);
/*
* tldlist_iter_destroy destroys the iterator specified by `iter'
*/
void tldlist_iter_destroy(TLDIterator *iter);
/*
* tldnode_tldname returns the tld associated with the TLDNode
*/
char *tldnode_tldname(TLDNode *node);
/*
* tldnode_count returns the number of times that a log entry for the
* corresponding tld was added to the list
*/
long tldnode_count(TLDNode *node);
#endif /* _TLDLIST_H_INCLUDED_ */
最佳答案
这些错误是由于缺少原型(prototype)引起的 - 您在 tldlist.c 中调用的函数,编译器尚未看到其定义。
默认情况下,编译器假设任何未知函数返回 int(遗留回溯到非常早期的 C,如果返回类型是 int,您可以将其省略)。这就是您收到不兼容类型消息的原因:)
您需要向编译器提供函数声明。您可以通过在 tldlist.c 的顶部添加原型(prototype) stub 或通过创建定义它们的 tldnode.h 来做到这一点(因为它似乎主要是您缺少的节点相关函数)。
tldnode_create 的实现是
TLDNode *tldnode_create(char *element) {
所以你需要声明
TLDNode *tldnode_create(char *element);
在尝试使用它之前:到 tldnode.h 或 tldlist.c 顶部的某处,例如在声明 tldnode 结构之后。
/*
* TODO: check the definition of element.
*/
struct tldnode {
struct tldnode *parent;
struct tldnode *left;
struct tldnode *right;
char *element;
long count;
};
TLDNode *tldnode_create(char *element);
关于C 编译器错误 : conflicting types, 整数到指针的转换不兼容,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/19642931/
我已经使用 vue-cli 两个星期了,直到今天一切正常。我在本地建立这个项目。 https://drive.google.com/open?id=0BwGw1zyyKjW7S3RYWXRaX24tQ
您好,我正在尝试使用 python 库 pytesseract 从图像中提取文本。请找到代码: from PIL import Image from pytesseract import image_
我的错误 /usr/bin/ld: errno: TLS definition in /lib/libc.so.6 section .tbss mismatches non-TLS reference
我已经训练了一个模型,我正在尝试使用 predict函数但它返回以下错误。 Error in contrasts<-(*tmp*, value = contr.funs[1 + isOF[nn]])
根据Microsoft DataConnectors的信息我想通过 this ODBC driver 创建一个从 PowerBi 到 PostgreSQL 的连接器使用直接查询。我重用了 Micros
我已经为 SoundManagement 创建了一个包,其中有一个扩展 MediaPlayer 的类。我希望全局控制这个变量。这是我的代码: package soundmanagement; impo
我在Heroku上部署了一个应用程序。我正在使用免费服务。 我经常收到以下错误消息。 PG::Error: ERROR: out of memory 如果刷新浏览器,就可以了。但是随后,它又随机发生
我正在运行 LAMP 服务器,这个 .htaccess 给我一个 500 错误。其作用是过滤关键字并重定向到相应的域名。 Options +FollowSymLinks RewriteEngine
我有两个驱动器 A 和 B。使用 python 脚本,我在“A”驱动器中创建一些文件,并运行 powerscript,该脚本以 1 秒的间隔将驱动器 A 中的所有文件复制到驱动器 B。 我在 powe
下面的函数一直返回这个错误信息。我认为可能是 double_precision 字段类型导致了这种情况,我尝试使用 CAST,但要么不是这样,要么我没有做对...帮助? 这是错误: ERROR: i
这个问题已经有答案了: Syntax error due to using a reserved word as a table or column name in MySQL (1 个回答) 已关闭
我的数据库有这个小问题。 我创建了一个表“articoli”,其中包含商品的品牌、型号和价格。 每篇文章都由一个 id (ID_ARTICOLO)` 定义,它是一个自动递增字段。 好吧,现在当我尝试插
我是新来的。我目前正在 DeVry 在线学习中级 C++ 编程。我们正在使用 C++ Primer Plus 这本书,到目前为止我一直做得很好。我的老师最近向我们扔了一个曲线球。我目前的任务是这样的:
这个问题在这里已经有了答案: What is an undefined reference/unresolved external symbol error and how do I fix it?
我的网站中有一段代码有问题;此错误仅发生在 Internet Explorer 7 中。 我没有在这里发布我所有的 HTML/CSS 标记,而是发布了网站的一个版本 here . 如您所见,我在列中有
如果尝试在 USB 设备上构建 node.js 应用程序时在我的树莓派上使用 npm 时遇到一些问题。 package.json 看起来像这样: { "name" : "node-todo",
在 Python 中,您有 None单例,在某些情况下表现得很奇怪: >>> a = None >>> type(a) >>> isinstance(a,None) Traceback (most
这是我的 build.gradle (Module:app) 文件: apply plugin: 'com.android.application' android { compileSdkV
我是 android 的新手,我的项目刚才编译和运行正常,但在我尝试实现抽屉导航后,它给了我这个错误 FAILURE: Build failed with an exception. What wen
谁能解释一下?我想我正在做一些非常愚蠢的事情,并且急切地等待着启蒙。 我得到这个输出: phpversion() == 7.2.25-1+0~20191128.32+debian8~1.gbp108
我是一名优秀的程序员,十分优秀!