代码搜索：basically

找到约 957 项符合「basically」的源代码

代码结果 957
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/127781/5999793

h sgihpc.h

/* * sgihpc.h: Various HPC I/O controller defines. The HPC is basically * the approximate functional equivalent of the Sun SYSIO * on SGI INDY machines. * * Copyright (C) 199
·
www.eeworm.com/read/127781/5999890

h sgihpc.h

/* * sgihpc.h: Various HPC I/O controller defines. The HPC is basically * the approximate functional equivalent of the Sun SYSIO * on SGI INDY machines. * * Copyright (C) 199
·
www.eeworm.com/read/119796/6082325

s vectors.s

/* * vectors.s: micromonitor exception-handling * * Basic interrupt handling code. These are the ISRs used * by the monitor. They basically save processor state and call * the respective C hand
·
www.eeworm.com/read/119796/6082343

s vectors.s

/* * vectors.s: micromonitor exception-handling * * Basic interrupt handling code. These are the ISRs used * by the monitor. They basically save processor state and call * the respective C hand
·
www.eeworm.com/read/110034/6170896

h sgihpc.h

/* * sgihpc.h: Various HPC I/O controller defines. The HPC is basically * the approximate functional equivalent of the Sun SYSIO * on SGI INDY machines. * * Copyright (C) 199
·
www.eeworm.com/read/110034/6170987

h sgihpc.h

/* * sgihpc.h: Various HPC I/O controller defines. The HPC is basically * the approximate functional equivalent of the Sun SYSIO * on SGI INDY machines. * * Copyright (C) 199
·
www.eeworm.com/read/100601/6267393

timetest

#!/bin/sh # # Simple timing test for the MPI library. Basically, we use prime # generation as a timing test, since it exercises most of the pathways # of the library fairly heavily. The 'primegen'
·
www.eeworm.com/read/491185/6441514

m gaborfilter.m

%%%%%%%VERSION 1 %The Gabor filter is basically a Gaussian (with variances sx and sy along x and y-axes respectively) %modulated by a complex sinusoid (with centre frequencies U and V along x and
·
www.eeworm.com/read/480844/6662474

txt lesson3.txt

Lesson 3: Loops This is the third installment of the Lessons in C programming tutorials created by me, Alexander. In this lesson I will cover loops. Loops basically do what it sounds like
·
www.eeworm.com/read/405817/11456418

cpp repairing company(dag最小路径覆盖).cpp

//This problem is basically a minimum path cover problem. //Use a direct graph to represent the relations between tasks. //If it is possible for a repairman to show up in time for task j after fin
·