Subject:
|
Re: MPD file loading search order
|
Newsgroups:
|
lugnet.cad.dev
|
Date:
|
Wed, 26 Jul 2006 20:12:32 GMT
|
Viewed:
|
2484 times
|
| |
|
|
Tim Gould wrote:
> In lugnet.cad.dev, Anders Isaksson wrote:
> >
> > What about the following algorithm (assuming everything is cached):
> >
> > - whenever a file reference is read, search for the file in the
> > cache. if not found, add it as an empty file and flag it as
> > 'incomplete'
> >
> > - whenever a 'file' is seen, search for it in the cache.
> > if not found, add it
> > if found, but 'incomplete', update it
> >
> > Where does a second pass enter in this?
>
> That is a two pass algorithm. It's optimised by only searching files
> that have already appeared but the search in stage II is a second
> pass.
Actually I can't get my head around 'searching for a file in the cache' as
equivalent to 'do a second pass of the source file'. Every part is searched
for in the cache. Each source line is only read and parsed once. What am I
not understanding?
--
Anders Isaksson, Sweden
BlockCAD: http://web.telia.com/~u16122508/proglego.htm
Gallery: http://web.telia.com/~u16122508/gallery/index.htm
|
|
Message has 1 Reply:
 | | Re: MPD file loading search order
|
| (...) I suspect there's two definitions of "pass" at work here. I would consider a two pass algorithm to be anything requiring two loops (which we must have either way as their is no reference order specified in MPDs). Another way of considering it (...) (18 years ago, 27-Jul-06, to lugnet.cad.dev)
|
Message is in Reply To:
29 Messages in This Thread:
 
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
