?? dkrgrprn.c
字號(hào):
/*
Copyright (c) 2003, Dan Kranz and Arnold Rom
All rights reserved.
Redistribution and use in source and binary forms, with or
without modification, are permitted provided that the following
conditions are met:
* Redistributions of source code must retain the above
copyright notice, this list of conditions and the following
disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials
provided with the distribution.
* The names of its contributors may not be used to endorse or
promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* For all block lines of first/lnextl, the number stored at block[field]
is compared with drange.
Entries falling within drange are entered in match/lnextl.
Non-matching entries remain in first/lnextl.
*/
#include <stdio.h>
#include <stdlib.h>
#include <roots.h>
void rgrprn(void *block, long *cpl, long *field, double *drange,
long *first, unsigned short *lnextl, long *match)
{
double rnum;
long cur_line, prev_line, next_line, last_match;
long lguard=MAXLIN;
BYTE *bpt, *b;
static long c_1 = 1;
if (*cpl < 1 ||
*field < 1 ||
*(field+1) < 1 ||
*field + *(field+1) - 1 > *cpl )
{
RootsSOS("rgrprn() sos!");
abort();
}
bpt = (BYTE*) block;
bpt -= *cpl;
--lnextl;
*match = prev_line = last_match = 0;
cur_line = *first;
while (cur_line != 0) {
if (!lguard--) {
RootsSOS("rgrprn() Bad input list!");
abort();
}
next_line = *(lnextl+cur_line);
b = bpt + ((*cpl) * cur_line);
runpac(b,field,&rnum,&c_1);
if (rnum >= *drange && rnum <= *(drange+1)) {
/* Disconnect current line from top of input list */
if (prev_line == 0)
*first = next_line;
/* Disconnect current line from spot other than top of input list */
else *(lnextl+prev_line) = (unsigned short) next_line;
/* Insert current line into match list */
/* First member of match list */
if (last_match==0)
*match = cur_line;
/* Extend match list */
else *(lnextl+last_match) = (unsigned short) cur_line;
last_match = cur_line;
}
else prev_line = cur_line;
cur_line = next_line;
}
if (last_match != 0)
*(lnextl+last_match) = 0;
}
?? 快捷鍵說(shuō)明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -