代码搜索：methods
找到约 10,000 项符合「methods」的源代码
代码结果 10,000
www.eeworm.com/read/226428/14475012
h btnode.h
// -*- Mode: C++ -*-
// BTnode.h
//
// Copyright (c) 1996, Regents of the University of California
// $Header: /usr/local/devel/GiST/libGiST/BTree/BTnode.h,v 1.1.1.1 1996/08/06 23:47:18
www.eeworm.com/read/122674/14676193
h dsearch.h
#ifndef DATATYPE_SEARCH_METHODS
#define DATATYPE_SEARCH_METHODS
// search the n element arrray a for a match with key
// using the sequential search. return the index of the
// matching array el
www.eeworm.com/read/221894/14715381
h 10_5.h
#ifndef SEARCH_METHODS
#define SEARCH_METHODS
// 用折半查找方法，在元素呈升序排列的数组list中查找值为key的元素
template
int BinSearch(T list[], int n, T key)
{
int mid, low, high;
T midvalue;
low=
www.eeworm.com/read/221894/14715385
h 10_4.h
#ifndef SEARCH_METHODS
#define SEARCH_METHODS
//用顺序查找法在数组list中查找值为key的元素
//若找到，返回该元素下标，否则返回-1
template
int SeqSearch(T list[], int n, T key)
{
for(int i=0;i < n;i++)
if (l
www.eeworm.com/read/120449/14803137
h worldmodel.h
/*
Copyright (c) 2000-2002, Jelle Kok, University of Amsterdam
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the f
www.eeworm.com/read/219532/14876547
h cwinscripthost.h
//
// CWinScriptHost.h
//
// --------------------------------------------------------
// A Practical Guide to Script-Driven Software Development
// Author: Qiming Lu Date:
www.eeworm.com/read/219532/14876593
h mobile.h
//
// Mobile.h
//
// --------------------------------------------------------
// A Practical Guide to Script-Driven Software Development
// Author: Qiming Lu Date: 6/1/2006
www.eeworm.com/read/114621/15045762
txt ans2.txt
字典名：my dictionary
文件名：C:\java\大作业\test2.txt出错单词formatted 位于第 1 行
出错单词representations 位于第 1 行
出错单词objects 位于第 1 行
出错单词text-output 位于第 1 行
出错单词implements 位于第 1 行
出错单词methods 位于第 1 行
出错单词printstre
www.eeworm.com/read/215702/15052458
h 9_14.h
//9_14.h
#ifndef SEARCH_METHODS
#define SEARCH_METHODS
//用顺序查找法在数组list中查找值为key的元素
//若找到，返回该元素下标，否则返回-1
template
int SeqSearch(T list[], int n, T key)
{
for(int i=0;i < n;i++)
www.eeworm.com/read/215702/15052462
h 9_15.h
//9_15.h
#ifndef SEARCH_METHODS
#define SEARCH_METHODS
// 用折半查找方法，在元素呈升序排列的数组list中查找值为key的元素
template
int BinSearch(T list[], int n, T key)
{
int mid, low, high;
T midvalue;