代码搜索：pointers
找到约 4,056 项符合「pointers」的源代码
代码结果 4,056
www.eeworm.com/read/395387/8180624
h lustart.h
/*****************************************************
lustart.h - Startup data structure for ST7
----------------------------------------------------
Copyright (c) HIWARE AG, Basel, Switzerla
www.eeworm.com/read/292920/8324000
c swap3.c
/* swap3.c -- using pointers to make swapping work */
#include
void interchange(int * u, int * v);
int main(void)
{
int x = 5, y = 10;
printf("Originally x = %d and y = %d.
www.eeworm.com/read/413044/11168996
c swap3.c
/* swap3.c -- using pointers to make swapping work */
#include
void interchange(int * u, int * v);
int main(void)
{
int x = 5, y = 10;
printf("Originally x = %d and y = %d.
www.eeworm.com/read/412483/11198511
cpp opc_meshinterface.cpp
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
www.eeworm.com/read/201477/15407697
out winner.out
Enter number of players, between 8 and 20
Enter player values
The winner tree is
size = 10 LowExt = 4 Offset = 15
Winner tree pointers are
10 3 10 3 5 8 10 1 3
Changed player 2 to zero, new tre
www.eeworm.com/read/105051/15679194
todo
- Clean up the command-line parsing.
- Cleaned up documentation, with a real man page.
- Support for clusters larger than 16K. This would require changing
a lot of the SYSLINUX internals so we ca
www.eeworm.com/read/102394/15783855
todo
* Reorganize siman interfaces to allow iterative use.
* Maybe the routines can be made to work with pointers instead of structs
so that only pointer manipulation is done by the siman algorithm and
www.eeworm.com/read/100289/15877805
htm readme.htm
B-tree algorithms
B-tree algorithms
A B-tree is a data structure that maintains an ordered set of data and allows efficient operations to find, delete, insert, and browse th
www.eeworm.com/read/168845/5433803
rst indirect_iterator_eg.rst
Example
.......
This example prints an array of characters, using
``indirect_iterator`` to access the array of characters through an
array of pointers. Next ``indirect_iterator`` is used with th