代码搜索：PATH
找到约 10,000 项符合「PATH」的源代码
代码结果 10,000
www.eeworm.com/read/351971/10589923
c path.c
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
//
// This source code is licensed under Microsoft Shared Source License
// Version 1.0 for Windows CE.
// For a copy of the l
www.eeworm.com/read/275385/10820189
h path.h
#ifndef __PATH
#define __PATH
int UnwrapAroundCuts(float *phase, unsigned char *bitflags,
float *soln, int xsize, int ysize, int cut_code,
int debug_flag, char *i
www.eeworm.com/read/275385/10820221
c path.c
/*
* path.c -- function for unwrapping around cuts
*/
#include
#include
#include "list.h"
#include "grad.h"
#include "path.h"
/* Unwrap the phase data (by Itoh's metho
www.eeworm.com/read/273657/10907927
class path.class
www.eeworm.com/read/273657/10907950
java path.java
//path.java
该类用于描述乘车路线方案。
import java.util.*;
public class Path
{
public Vector pass_segment; //每一元素表示整个路线的一个路段Segment。
int segmentTotal; //需要的总路段数
int stationTotal; //整条路线中，所经过的车站的
www.eeworm.com/read/418361/10951953
c path.c
/* Code to mangle pathnames into those matching a given prefix.
eg. open("/lib/foo.so") => open("/usr/gnemul/i386-linux/lib/foo.so");
The assumption is that this area does not change.
*/
#inclu
www.eeworm.com/read/271758/10982406
m path.m
% 某只蚂蚁找到的某条路径routek,lengthk
function [routek,lengthk]=path(distance,tau,alpha,beta,Citystart)
distance=10;
[m,n]=size(distance);
if isempty(Citystart) % 如果不确定起点
p=fix(m*rand)+1;
www.eeworm.com/read/416734/11014399
ini path.ini
[SaveFile]
0=E:\xpsoft\useful\avr软件\avrautocode\last config.avr
1=D:\mcu\常用软件\avrautocode\last config.avr
2=D:\study\AVR单片机\常用软件\avrautocode\last config.avr
www.eeworm.com/read/416161/11039588
m path.m
% 某只蚂蚁找到的某条路径routek,lengthk
function [routek,lengthk]=path(distance,tau,alpha,beta,Citystart)
[m,n]=size(distance);
if isempty(Citystart) % 如果不确定起点
p=fix(m*rand)+1; % 随机方式