代码搜索：Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/409871/11309769
txt spmsgb94.txt
Subject: get out of debt fast ! - ukjx
> dear fellow entrepreneur , > > i never thought i 'd be the one telle you this . . . > > i actually read a piece of e - mail & i ' m goe to europe on the = pro
www.eeworm.com/read/405213/11469145
m disteuclideanpiotrdollar.m
% Calculates the Euclidean distance between vectors [FAST].
%
% Assume X is an m-by-p matrix representing m points in p-dimensional space and Y is an
% n-by-p matrix representing another set of poi
www.eeworm.com/read/158649/11595321
java failfast.java
//: c09:FailFast.java
// Demonstrates the "fail fast" behavior.
// {ThrowsException}
import java.util.*;
public class FailFast {
public static void main(String[] args) {
Collection c = n
www.eeworm.com/read/347853/11631529
pro ch07ex12.pro
/*
Turbo Prolog 2.0 Chapter 7, Example Program 10
Copyright (c) 1986, 88 by Borland International, Inc
Fast tree-based sort program.
Reads lines from a file, sorts them
www.eeworm.com/read/347053/11704309
java fastlanesearchdao.java
package com.ebusiness.ebank.dao;
/**
* Title: This class is an abstract super class for Fast Lane search design pattern
* Description:
* Copyright: Copyright (c) 2005
*
www.eeworm.com/read/156908/11753645
cpp ebrick2.cpp
/*
* Test program to implement Brickell et al's method for fast
* computation of g^x mod 2^m, for fixed g and n, using precomputation.
* This idea can be used to substantially speed up ce
www.eeworm.com/read/156908/11753846
txt kcmcomba.txt
In embedded applications on low-powered processors, performance is a big
issue. Using either the KCM or Comba methods as described here can increase
speeds 4-fold.
To use the super-fast KCM (for
www.eeworm.com/read/259580/11779667
cpp timefastsquarematrixmultiply2.cpp
// run time for fast square matrix multiply
// ikj order
#include
#include
#include "make2dArrayNoCatch.h"
using namespace std;
#pragma optimize("t", on)
void fastSquar