代码搜索：pointer
找到约 10,000 项符合「pointer」的源代码
代码结果 10,000
www.eeworm.com/read/346675/11733223
h fptree.h
/*----------------------------------------------------------------------
File : fptree.h
Contents: frequent pattern tree management
Author : Christian Borgelt
History : 21.11.2004 file cre
www.eeworm.com/read/260138/11744133
c os_mem.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/157035/11744348
c os_mem.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/260136/11744915
c os_mem.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/346401/11750249
pas billsetup.pas
unit BillSetup;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
BaseForm, StdCtrls, Buttons, ExtCtrls, dxCntner, dxTL, dxDBCtrl, dxDBGrid,
ComCt
www.eeworm.com/read/156948/11751172
java list.java
import java.io.*;
public class List {
// 用变量来实现表头
private Node Head = null;
private Node Tail = null;
private Node Pointer = null;
private int Length = 0;
/** 清空整个链表 */
public void
www.eeworm.com/read/156931/11752301
txt 860uartcode.txt
Title: ul.c
Transmit and receive data, UART mode, SCC1, loopback
Feb. 1, 1996
The results of this routine are:
1. Initializes for handling SCC1 interrupts.
2. Transmits four lines of a poem, one li
www.eeworm.com/read/259865/11760725
c useaddr.c
#include
void main(void)
{
int a = 1, b = 2;
int *i_pointer;
// Assign an address
i_pointer = &a;
// Change the value pointed to by i_pointer to 5
*i_point
www.eeworm.com/read/259865/11761106
c brk.c
#include
#include
void main(void)
{
char *ptr;
printf("Starting heap available %u\n", coreleft());
ptr = malloc(1); // Get pointer to current break v
www.eeworm.com/read/259580/11779882
h unionfindnode.h
// nodes used in union/find trees
#ifndef unionFindNode_
#define unionFindNode_
using namespace std;
struct unionFindNode
{
int parent; // if true then tree weight
/