代码搜索:structures

找到约 10,000 项符合「structures」的源代码

代码结果 10,000
www.eeworm.com/read/392997/7247719

h list.h

// list.h // Data structures to manage LISP-like lists. // // As in LISP, a list can contain any type of data structure // as an item on the list: thread control blocks, // pending interrupts
www.eeworm.com/read/392997/7247745

h disk.h

// disk.h // Data structures to emulate a physical disk. A physical disk // can accept (one at a time) requests to read/write a disk sector; // when the request is satisfied, the CPU gets an interru
www.eeworm.com/read/392997/7247839

h synchdisk.h

// synchdisk.h // Data structures to export a synchronous interface to the raw // disk device. // // Copyright (c) 1992-1993 The Regents of the University of California. // All rights reserved. Se
www.eeworm.com/read/392997/7247908

h noff.h

/* noff.h * Data structures defining the Nachos Object Code Format * * Basically, we only know about three types of segments: * code (read-only), initialized data, and unitialized data *
www.eeworm.com/read/457234/7330779

h regex.h

/* Definitions for data structures and routines for the regular expression library, version 0.12. Copyright (C) 1985, 89, 90, 91, 92, 93, 95 Free Software Foundation, Inc. This program is f
www.eeworm.com/read/450221/7488315

m data_structure.m

function data = data_structure(p,t) % Build data structures used in the solver. % % This function builds the mesh parameters and connectivity that will be % used in tvd_rk2.m. Building this init
www.eeworm.com/read/450221/7488323

m data_structure.m

function data = data_structure(p,t) % Build data structures used in the solver. % % This function builds the mesh parameters and connectivity that will be % used in tvd_rk2.m. Building this init
www.eeworm.com/read/436832/7762058

h ip.h

/* Ensure network structures aren't padded (DJGPP and VC) */ #define MAXDATA 1500 /* Maximum Ethernet data size */ #define MAXPACK (MAXDATA+14) /* Maximum packet size (incl. datali
www.eeworm.com/read/199358/7865064

htm article1046.asp.htm

Chess Programming Part II: Data Structures
www.eeworm.com/read/197649/7983217

m subsref.m

function x=subsref(c,s) % COMPONENTS/SUBSREF handles c(s) for Components structures switch s(1).type case '()' ind = s.subs{:}; if length(ind) ~= 1 error('Index