本文整理汇总了C++中create_list函数的典型用法代码示例。如果您正苦于以下问题:C++ create_list函数的具体用法?C++ create_list怎么用?C++ create_list使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了create_list函数的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。
示例1: new_list
static list_element *
new_list( void ) {
list_element *list;
if ( create_list( &list ) == false ) {
assert( 0 );
}
return list;
}
开发者ID:kazuyas,项目名称:trema-edge,代码行数:9,代码来源:stats-helper.c
示例2: config_defaults
void config_defaults(struct sway_config *config) {
config->symbols = create_list();
config->modes = create_list();
config->cmd_queue = create_list();
config->workspace_outputs = create_list();
config->current_mode = malloc(sizeof(struct sway_mode));
config->current_mode->name = NULL;
config->current_mode->bindings = create_list();
list_add(config->modes, config->current_mode);
// Flags
config->focus_follows_mouse = true;
config->mouse_warping = true;
config->reloading = false;
config->active = false;
config->failed = false;
config->gaps_inner = 0;
config->gaps_outer = 0;
}
开发者ID:z33ky,项目名称:sway,代码行数:18,代码来源:config.c
示例3: main
int main(int argv, char *argc[])
{
int node;
printf("No of nodes to create\n");
scanf("%d", &node);
create_list(node);
assign_data();
print_list();
}
开发者ID:WebEm,项目名称:embconnect,代码行数:9,代码来源:single_linked_list.c
示例4: init
void
CChoosebook::show()
{
init();
SetBackPixmap(g_pReciteWord->fixed,Skin->choosebook.choosebook.p[0]);
book_index_label = gtk_label_new(NULL);
gtk_fixed_put (GTK_FIXED (g_pReciteWord->fixed), book_index_label,
Skin->choosebook.book_index_label.x[0], Skin->choosebook.book_index_label.y[0]);
gtk_widget_show (book_index_label);
book_count_label = gtk_label_new(NULL);
gtk_fixed_put (GTK_FIXED (g_pReciteWord->fixed), book_count_label,
Skin->choosebook.book_count_label.x[0], Skin->choosebook.book_count_label.y[0]);
gtk_widget_show (book_count_label);
word_count_label = gtk_label_new(NULL);
gtk_fixed_put (GTK_FIXED (g_pReciteWord->fixed), word_count_label,
Skin->choosebook.word_count_label.x[0], Skin->choosebook.word_count_label.y[0]);
gtk_widget_show (word_count_label);
book_filename_label = gtk_label_new(NULL);
gtk_widget_set_size_request(book_filename_label, Skin->reciteword.width - Skin->choosebook.book_filename_label.x[0], -1);
gtk_label_set_line_wrap(GTK_LABEL(book_filename_label), true);
gtk_fixed_put (GTK_FIXED (g_pReciteWord->fixed), book_filename_label,
Skin->choosebook.book_filename_label.x[0], Skin->choosebook.book_filename_label.y[0]);
gtk_widget_show (book_filename_label);
list = create_list();
gtk_fixed_put (GTK_FIXED (g_pReciteWord->fixed), list, Skin->choosebook.book_list.x[0], Skin->choosebook.book_list.y[0]);
gtk_widget_show(list);
tree = create_tree();
gtk_fixed_put (GTK_FIXED (g_pReciteWord->fixed), tree, Skin->choosebook.book_tree.x[0], Skin->choosebook.book_tree.y[0]);
gtk_widget_show(tree);
if (g_pReciteWord->now_book && g_pReciteWord->now_book->bookfilename)
{
gchar *a,book_dir[256];
strcpy(book_dir,g_pReciteWord->now_book->bookfilename);
a=strrchr(book_dir,G_DIR_SEPARATOR);
if (a) // book_dir is not aways separate by G_DIR_SEPARATOR.
*a='\0';
GtkTreeModel *model;
model = gtk_tree_view_get_model(GTK_TREE_VIEW(tree_view));
gtk_tree_model_foreach (model,
select_dir_func,
&book_dir);
model = gtk_tree_view_get_model(GTK_TREE_VIEW(list_view));
gtk_tree_model_foreach (model,
select_book_func,
g_pReciteWord->now_book->bookfilename);
}
return_button.create(g_pReciteWord->fixed,Skin->choosebook.return_button.x[0],Skin->choosebook.return_button.y[0],Skin->choosebook.return_button.p[0],Skin->choosebook.return_button.p[1],Skin->choosebook.return_button.p[2],(GdkPixmap*) NULL,on_choosebook_return_clicked);
ok_button.create(g_pReciteWord->fixed,Skin->choosebook.ok_button.x[0],Skin->choosebook.ok_button.y[0],Skin->choosebook.ok_button.p[0],Skin->choosebook.ok_button.p[1],Skin->choosebook.ok_button.p[2],(GdkPixmap*) NULL,on_choosebook_ok_clicked);
}
开发者ID:wzssyqa,项目名称:ho22bus,代码行数:57,代码来源:choosebook.cpp
示例5: main
int main()
{
struct node *list = create_list(1024);
apply(list, &print);
free_list(list);
return 0;
}
开发者ID:tmiller,项目名称:data-structures,代码行数:9,代码来源:linked_list.c
示例6: create_list
priv_ptr PrivPtr::create_ptr(int level, int type)
{
priv_ptr ptr = (priv_ptr)malloc(sizeof(struct priv_ptr_));
ptr->list = create_list();
ptr->size = 0;
ptr->level = level;
ptr->type = type;
return ptr;
}
开发者ID:PICCO-Team,项目名称:picco,代码行数:9,代码来源:PrivPtr.cpp
示例7: testcases
void testcases()
{
struct node *res,*output;
char *ip,*op;
int i,check;
for(i=0;i<9;i++)
{
res=output=NULL;
ip=op=NULL;
ip=malloc_str(testDB[i].input);
ip=valid_str(ip);
//if(ip==NULL)
//printf("hai\n");
if(ip!=NULL)
{
ip=rem_space(ip);
res=create_list(ip);
//display(res);
res=swap_adj_nodes(res);
}
else
{
res=NULL;
}
op=malloc_str(testDB[i].output);
output=create_list(op);
//if(res==NULL)
check=list_cmp(res,output);
display(res);
display(output);
if(check==0)
printf("passed\n");
else
printf("failed\n");
free(op);
free(ip);
free(res);
free(output);
}
}
开发者ID:ravitejamullapudi,项目名称:C-Programs,代码行数:44,代码来源:list9.c
示例8: ipc_update_workspaces
static void ipc_update_workspaces(struct bar *bar) {
int i;
for (i = 0; i < bar->outputs->length; ++i) {
struct output *output = bar->outputs->items[i];
if (output->workspaces) {
free_workspaces(output->workspaces);
}
output->workspaces = create_list();
}
uint32_t len = 0;
char *res = ipc_single_command(bar->ipc_socketfd, IPC_GET_WORKSPACES, NULL, &len);
json_object *results = json_tokener_parse(res);
if (!results) {
free(res);
return;
}
int length = json_object_array_length(results);
json_object *ws_json;
json_object *num, *name, *visible, *focused, *out, *urgent;
for (i = 0; i < length; ++i) {
ws_json = json_object_array_get_idx(results, i);
json_object_object_get_ex(ws_json, "num", &num);
json_object_object_get_ex(ws_json, "name", &name);
json_object_object_get_ex(ws_json, "visible", &visible);
json_object_object_get_ex(ws_json, "focused", &focused);
json_object_object_get_ex(ws_json, "output", &out);
json_object_object_get_ex(ws_json, "urgent", &urgent);
int j;
for (j = 0; j < bar->outputs->length; ++j) {
struct output *output = bar->outputs->items[j];
if (strcmp(json_object_get_string(out), output->name) == 0) {
struct workspace *ws = malloc(sizeof(struct workspace));
ws->num = json_object_get_int(num);
ws->name = strdup(json_object_get_string(name));
ws->visible = json_object_get_boolean(visible);
ws->focused = json_object_get_boolean(focused);
if (ws->focused) {
if (bar->focused_output) {
bar->focused_output->focused = false;
}
bar->focused_output = output;
output->focused = true;
}
ws->urgent = json_object_get_boolean(urgent);
list_add(output->workspaces, ws);
}
}
}
json_object_put(results);
free(res);
}
开发者ID:Hummer12007,项目名称:sway,代码行数:56,代码来源:ipc.c
示例9: main
int main()
{
struct list *head=create_list(0,NULL);
struct list *temp=head;
int n=10;
for(int i=1;i<=n;i++)
{
temp->right=create_list(i,temp);
temp=temp->right;
}
display(head);
head=to_bst(&head,n+1);
inorder(head);
}
开发者ID:abhinavaggarwal018,项目名称:C--,代码行数:19,代码来源:New-In-place+conversion+of+Sorted+DLL+to+Balanced+BST.cpp
示例10: UpdateData
void ship_select::OnFilterShips()
{
int i;
UpdateData(TRUE);
create_list();
for (i = 0; i < Num_iffs; i++)
GetDlgItem(IDC_FILTER_SHIPS_IFF[i])->EnableWindow(m_filter_ships);
}
开发者ID:n-kawamt,项目名称:fs2open_snapshot,代码行数:10,代码来源:ship_select.cpp
示例11: calloc
static swayc_t *new_swayc(enum swayc_types type) {
swayc_t *c = calloc(1, sizeof(swayc_t));
c->handle = -1;
c->layout = L_NONE;
c->type = type;
if (type != C_VIEW) {
c->children = create_list();
}
return c;
}
开发者ID:Half-Shot,项目名称:sway,代码行数:10,代码来源:container.c
示例12: main
main()
{
struct node *start=NULL;
start=create_list(start);
display(start);
MoveLarge(start);
display(start);
MoveSmall(start);
display(start);
}/*End of main()*/
开发者ID:singharpit94,项目名称:cprograms,代码行数:10,代码来源:E9_E10.c
示例13: check_and_fix_records
/*=================================
* check_and_fix_records --
*================================*/
static void
check_and_fix_records (void)
{
tofix = create_list();
todo.pass = 1;
check_nodes();
todo.pass = 2;
fix_nodes();
destroy_empty_list(tofix);
}
开发者ID:MarcNo,项目名称:lifelines,代码行数:13,代码来源:dbverify.c
示例14: test
void test(int test[], int n) {
struct ListNode *list;
create_list(test, n, &list);
print_list(list);
list = swapPairs(list);
//list = swapPairs_by_ulyx(list);
print_list(list);
free_list(&list);
printf("\n");
}
开发者ID:DavidFeng,项目名称:lovely_codes,代码行数:10,代码来源:simple_list.c
示例15: init_meter_table
void
init_meter_table( void ) {
assert( table == NULL );
table = xmalloc( sizeof( meter_table ) );
memset( table, 0, sizeof( meter_table ) );
create_list( &table->entries );
table->initialized = true;
}
开发者ID:cs470Group,项目名称:sdn-controller,代码行数:10,代码来源:meter_table.c
示例16: copy_list
/** copy_list
*
* Create a new list structure, new nodes, and new copies of the data by using
* the copy function. Its implementation for any test structure must copy
* EVERYTHING!
*
* @param llist A pointer to the linked list to make a copy of
* @param copy_func A function pointer to a function that makes a copy of the
* data that's being used in this linked list, allocating space for
* every part of that data on the heap. This is some function you must
* write yourself for testing, tailored specifically to whatever context
* you're using the linked list for in your test.
* @return The linked list created by copying the old one
*/
list* copy_list(list* llist, list_cpy copy_func)
{
list* copy_list_p = create_list();
node* current = llist->head;
while (current != NULL) {
push_back(copy_list_p, copy_func(current->data));
current = current->next;
}
return copy_list_p;
}
开发者ID:lovissahuigita,项目名称:linkedlist,代码行数:24,代码来源:list.c
示例17: set_match_type
static bool
set_match_type( int argc, char *argv[], services *services ) {
create_list( &services->arp_or_unicast );
create_list( &services->broadcast );
int i;
char *service_name;
for ( i = 1; i < argc; i++ ) {
if ( ( service_name = match_type( ARP_OR_UNICAST, argv[ i ] ) ) != NULL ) {
append_to_tail( &services->arp_or_unicast, service_name );
}
else if ( ( service_name = match_type( BROADCAST, argv[ i ] ) ) != NULL ) {
append_to_tail( &services->broadcast, service_name );
}
else {
return false;
}
}
return true;
}
开发者ID:iqm,项目名称:apps,代码行数:20,代码来源:packetin_dispatcher.c
示例18: main
void main(void){
int arr[]={1,2,3,4,5,6,7,8,9};
int len=sizeof(arr)/sizeof(arr[0]);
Node *list=create_list(arr,len);
char *str;
str=to_str(list,len);
printf("%s\n",str);
int rst=dll_remove(list,list->fwd->fwd);
str=to_str(list,len);
printf("%s\n",str);
}
开发者ID:NoPointExc,项目名称:Pointers_On_C,代码行数:11,代码来源:exc6.c
示例19: main
int main(){
int arr[] = {1, 2, 3, 4, 5};
ListNode* l = create_list(arr, sizeof(arr)/sizeof(arr[0]));
ListNode* r = swapPairs(l);
while(r){
printf("%d ", r->val);
r = r->next;
}
printf("\n");
return 0;
}
开发者ID:fengyu225,项目名称:leetcode,代码行数:11,代码来源:swap_nodes_in_pairs.cpp
示例20: init_match_table
void
init_match_table( void ) {
match_table_head.exact_table = create_hash( compare_match_entry, hash_match_entry );
create_list( &match_table_head.wildcard_table );
pthread_mutexattr_t attr;
pthread_mutexattr_init( &attr );
pthread_mutexattr_settype( &attr, PTHREAD_MUTEX_RECURSIVE_NP );
match_table_head.mutex = xmalloc( sizeof( pthread_mutex_t ) );
pthread_mutex_init( match_table_head.mutex, &attr );
}
开发者ID:n-tada,项目名称:trema,代码行数:11,代码来源:match_table.c
注:本文中的create_list函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论