03-31-2011
the use of head was from an example, but i don't understand why its being done, and why my function isn't working the same way (without using head)
10 More Discussions You Might Find Interesting
1. Programming
Can any one help me in reversing the single linked list and at the same time i want to print the reversed links. (2 Replies)
Discussion started by: dhanamurthy
2 Replies
2. UNIX for Dummies Questions & Answers
A perl script that displays the list of files which have multiple links..!
ls -l shows number of links in a field. (0 Replies)
Discussion started by: aadi_uni
0 Replies
3. Programming
is this possible, if so plz please share with me..
Correct English please, not Cyber-/Leetspeak (11 Replies)
Discussion started by: vijay_manpage
11 Replies
4. Programming
I need C++ Code for single linked list
With operations as
1)insert at any position
2)delete any
3)change the data of any position (2 Replies)
Discussion started by: girija
2 Replies
5. Programming
i have a linked list set up like
typedef struct client_list {
char *client_name;
int client_socket_fd;
struct client_list *next;
} client;
client *client_list=NULL;
before adding to the list i check if it already exists, only if it does not then i add
if (client_list==NULL... (1 Reply)
Discussion started by: omega666
1 Replies
6. Programming
can someone provide an example of a struct linked list, where it has strings as its values, and then how do I check if a specific string (say called buffer) exists in the list of structs?
i dont understand how to make a copy of it to check with
this is what i have
... (0 Replies)
Discussion started by: omega666
0 Replies
7. UNIX for Advanced & Expert Users
Hi, I am programming in kernel, and I want to use a double linked list that holds infos that every process could access and modify THIS list. So, I suppose it is a 'global' variable since every process(thread) can reach it, I am wondering where to put it? by changing some of the kernel files? (1 Reply)
Discussion started by: louisTan
1 Replies
8. Programming
#include<stdio.h>
#include<stdlib.h>
struct LinkedList
{
int val;
struct LinkedList *next;
}node; /*Creating a structure variable*/
typedef struct LinkedList Node;
Node *start = NULL;
int create(int i)
{
Node *temp = NULL;
if (start == NULL)
... (5 Replies)
Discussion started by: prinsh
5 Replies
9. Programming
How to delete the last node in a single linked list given only the pointer to last node ?
Head node will not be given. (5 Replies)
Discussion started by: VSSajjan
5 Replies
10. Programming
Program to reverse a linked list by traversing only once. (1 Reply)
Discussion started by: VSSajjan
1 Replies
LEARN ABOUT HPUX
xtpeekevent
XtPeekEvent() XtPeekEvent()
Name
XtPeekEvent - return, but do not remove the event at the head of an application's input queue.
Synopsis
Boolean XtPeekEvent(event_return)
XEvent *event_return;
Inputs
event_return
Returns the event information from the head event structure in the queue.
Returns
True if the event at the head of the queue is an X event; False if it is a timer event or an alternate input source event.
Availability
XtPeekEvent() has been superseded by XtAppPeekEvent().
Description
XtPeekEvent() returns a copy of the X event at the head of the input queue, without removing it from the queue. If there is an X event, it
returns True. If there are no X events pending, but there are timer or alternate events, XtPeekEvent() returns False. If there are no
events pending, XtPeekEvent() blocks.
Usage
XtPeekEvent() has been superseded by XtAppPeekEvent(), which performs the same function on a per-application context basis. XtPeekEvent()
now calls XtAppPeekEvent() passing the default application context created by XtInitialize(). Very few programs need multiple application
contexts, and you can continue to use XtPeekEvent() if you initialize your application with XtInitialize(). We recommend, however, that
you use XtAppInitialize(), XtAppPeekEvent(), and the other XtApp*() application context specific functions.
See XtAppPeekEvent() for more information.
Programs rarely need this much control over the event dispatching mechanism. Most programs use XtAppMainLoop().
See Also
XtAppMainLoop(1), XtAppPeekEvent(1), XtAppPending(1).
Xt - Event Handling XtPeekEvent()