代码搜索：checking
找到约 6,492 项符合「checking」的源代码
代码结果 6,492
www.eeworm.com/read/344797/11859742
configure
#! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
# Generated automatically using autoconf version 2.13
# Copyright (C) 1992, 93, 94, 95, 96 Free Software Foundation, In
www.eeworm.com/read/258337/11869126
configure
#! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
# Generated automatically using autoconf version 2.13
# Copyright (C) 1992, 93, 94, 95, 96 Free Software Foundation, In
www.eeworm.com/read/153823/12004147
m invproj.m
function XY = invproj(XY)
%INVPROJ Inverse Mercator projection.
% XY = invproj(XY)
% y = invproj(y)
% XY = two-column matrix of longitude-latitude pairs (in decimal degrees)
% y = colum
www.eeworm.com/read/153823/12004198
m randx.m
function X = randX(P,n)
%RANDX Random generation of n points X that are within P's boundaries.
% X = randX(P,n)
% Generates n x d matrix X of n random d-dimensional NF locations, where
% each
www.eeworm.com/read/153823/12004226
m combinerte.m
function [cmbrte,st] = combinerte(out)
%COMBINERTE Combine non-overlapping routes.
% [cmbrte,st] = combinerte(out)
% out = m-element struct array of timing output from RTETC
%cmbrte = combine no
www.eeworm.com/read/153823/12004255
m is0.m
function y = is0(x,Tol)
%IS0 True for zero elements (within tolerance).
% y = is0(x,Tol)
% = abs(x) < Tol
% Tol = tolerance
% = [0.01*sqrt(eps)], default
% Copyright (c) 1994
www.eeworm.com/read/153823/12004257
m vrpsolrc101.m
%VRPSOLRC101 Soloman's VRP with Time Windows problem RC101 data.
%Run vrpsolrc101 to load into workspace:
% XY = vertex cooridinates
% q = vertex demands, with depot q(1) = 0
% Q = maxi
www.eeworm.com/read/153823/12004260
m tri2list.m
function IJ = tri2list(T)
%TRI2LIST Convert triangle indices to arc list representation.
% IJ = tri2list(T)
% T = n x 3 matrix, where each row defines indices for one of n
% triang
www.eeworm.com/read/153823/12004265
m tri2adj.m
function A = tri2adj(T)
%TRI2ADJ Triangle indices to adjacency matrix representation.
% A = tri2adj(T)
% T = n x 3 matrix, where each row defines indices for one of n
% triangles