代码搜索：Delete
找到约 10,000 项符合「Delete」的源代码
代码结果 10,000
www.eeworm.com/read/219532/14876530
h safe_defs.h
//
// safe_defs.h
//
#pragma once
#define SAFE_DELETE(p) { if(p) { delete (p); (p)=0; } }
#define SAFE_DELETE_ARRAY(p) { if(p) { delete[] (p); (p)=0; } }
#define SAFE_RELEASE(p) { if(p)
www.eeworm.com/read/219532/14876576
h safe_defs.h
//
// safe_defs.h
//
#pragma once
#define SAFE_DELETE(p) { if(p) { delete (p); (p)=0; } }
#define SAFE_DELETE_ARRAY(p) { if(p) { delete[] (p); (p)=0; } }
#define SAFE_RELEASE(p) { if(p)
www.eeworm.com/read/219532/14876826
h safe_defs.h
//
// safe_defs.h
//
#pragma once
#define SAFE_DELETE(p) { if(p) { delete (p); (p)=0; } }
#define SAFE_DELETE_ARRAY(p) { if(p) { delete[] (p); (p)=0; } }
#define SAFE_RELEASE(p) { if(p)
www.eeworm.com/read/127438/6006093
c commdelattrf.c
/* -*- Mode: C; c-basic-offset:4 ; -*- */
/*
* (C) 2001 by Argonne National Laboratory.
* See COPYRIGHT in top-level directory.
*
* This file is automatically generated by buildiface
* D
www.eeworm.com/read/127438/6006163
c null_del_fnf.c
/* -*- Mode: C; c-basic-offset:4 ; -*- */
/*
* (C) 2001 by Argonne National Laboratory.
* See COPYRIGHT in top-level directory.
*
* This file is automatically generated by buildiface
* D
www.eeworm.com/read/127438/6006203
c typedelattrf.c
/* -*- Mode: C; c-basic-offset:4 ; -*- */
/*
* (C) 2001 by Argonne National Laboratory.
* See COPYRIGHT in top-level directory.
*
* This file is automatically generated by buildiface
* D
www.eeworm.com/read/127438/6006279
c windelattrf.c
/* -*- Mode: C; c-basic-offset:4 ; -*- */
/*
* (C) 2001 by Argonne National Laboratory.
* See COPYRIGHT in top-level directory.
*
* This file is automatically generated by buildiface
* D
www.eeworm.com/read/154509/5636875
txt 算法 8.6.txt
算法 8.6
void Delete_BST (BiTree &T, KeyType kval ) {
// 若二叉查找树T中存在关键字等于kval的数据元素，则删除之。
f = NULL;
if (Search_BST(T,kval,p,f)) { // 找到其关键字等于kval的数据元素
if (p->lchild &&
www.eeworm.com/read/154509/5637115
txt 算法 8.6.txt
算法 8.6
void Delete_BST (BiTree &T, KeyType kval ) {
// 若二叉查找树T中存在关键字等于kval的数据元素，则删除之。
f = NULL;
if (Search_BST(T,kval,p,f)) { // 找到其关键字等于kval的数据元素
if (p->lchild &&