代码搜索结果

//------------------------------------------------------------------- // Author........: Aleksander 豩rn // Date..........: 960307 // Description...: // Revisions.....: //=========================

#!/bin/sh for file in `cat ../export_names` do rm -fr $file.h cat stl_tmpl.h | sed -e "s/REPLACEME/$file/g" > $file.h done mv algorithm.h algorith.h mv functional.h function.h mv stdexcept.h

algorithm bitset cassert cctype cerrno cfloat climits clocale cmath complex config csetjmp csignal cstd cstdarg cstddef cstdio cstdlib cstring ctime cwchar cwctype deque fstream

package com.borland.training.meetings.entities; // This is a factory class that encapsulates creating a concrete primary key // generation algorithm, making future changes of this algorithm easy. pu

The compressor achieves an average compression rate of 60% of the original size which is on par with "gzip". It seems that you cannot do much better for compressing compiled binaries. This mea

\bf Animation of Heapsort Algorithm \tt programmed by Oliver Zlotowski \tt Martin-Luther-University Halle/Wittenberg \tt\grey2 December 1998

Start the Animation Adjustments About About over the Algorithm Exit

The following animation shows the functioning of Quicksort. In the animation window an array is shown that is to be sorted by Quicksort. The window \tt \rm shows the algorithm. In each

\bf Animation of Quicksort Algorithm \tt programmed by Oliver Zlotowski \tt Martin-Luther-University Halle/Wittenberg \tt\grey2 December 1998

Start the Animation Adjustments About About the Algorithm Compare Algorithms Exit