代码搜索:INTERVAL
找到约 8,094 项符合「INTERVAL」的源代码
代码结果 8,094
www.eeworm.com/read/102395/6233334
txt new_j.txt
The variable \tt\green2 j\rm\black is set to index \tt r+1 \rm of array \tt A\rm , that is, one more than the right end of the
considered interval.
That means that \tt j \rm is a temporary right poi
www.eeworm.com/read/101082/6251578
c getcodi.c
#ifndef lint
static char sccsid[] = "@(#)getcodi.c 4.2 (Berkeley) 5/27/83";
#endif not lint
# include "getpar.h"
/*
** get course and distance
**
** The user is asked for a course and distance. Th
www.eeworm.com/read/101082/6251623
c getcodi.c
#ifndef lint
static char sccsid[] = "@(#)getcodi.c 4.2 (Berkeley) 5/27/83";
#endif not lint
# include "getpar.h"
/*
** get course and distance
**
** The user is asked for a course and distance. Th
www.eeworm.com/read/101066/6256198
c sntpslib.c
/* sntpsLib.c - Simple Network Time Protocol (SNTP) server library */
/* Copyright 1984 - 2000 Wind River Systems, Inc. */
#include "copyright_wrs.h"
/*
modification history
--------------------
01
www.eeworm.com/read/100603/6266216
cpp rcinrval.cpp
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/*
* The contents of this file are subject to the Mozilla Public
* License Version 1.1 (the "License"); you may not u
www.eeworm.com/read/338293/12314583
m gravity.m
function [A,b,x] = gravity(n,example,a,b,d)
%GRAVITY Test problem: 1-D gravity surveying model problem
%
% [A,b,x] = gravity(n,example,a,b,d)
%
% Discretization of a 1-D model problem in gravity
www.eeworm.com/read/250808/12383690
m vint2t.m
function [t1,t2]=vint2t(vint,z,zout,tnot)
% VINT2T: compute time given interval velocity versus depth
%
% [t1,t2]=vint2t(vint,z,zout,tnot)
% [t1,t2]=vint2t(vint,z,zout);
% t1=vint2t(vint,z);
%
www.eeworm.com/read/229449/14338766
c rtc.c
/*
-02/24/2006: Petre M.
-this file contains functions that deal with Real Time Clock
*/
#include "ioADE7169F16.h"
#include "extern_declarations.h"
#include "EEPROM_locations.h"
//this
www.eeworm.com/read/122139/14718807
h site.h
// Larbin
// Sebastien Ailleret
// 08-02-00 -> 08-02-00
// This is the new structure of a site
// It includes a fifo of waiting urls
#ifndef SITE_H
#define SITE_H
#include
#include
www.eeworm.com/read/120309/14806523
htm chap15.htm
Intro to Algorithms: CHAPTER 15: AUGMENTING DATA STRUCTURES