/* * Copyright (C) 1998 by Southwest Research Institute (SwRI) * * All rights reserved under U.S. Copyright Law and International Conventions. * * The development of this Software was supported by contracts NAG5-3148, * NAG5-6855, NAS8-36840, NAG5-2323, and NAG5-7043 issued on behalf of * the United States Government by its National Aeronautics and Space * Administration. Southwest Research Institute grants to the Government, * and others acting on its behalf, a paid-up nonexclusive, irrevocable, * worldwide license to reproduce, prepare derivative works, and perform * publicly and display publicly, by or on behalf of the Government. * Other than those rights granted to the United States Government, no part * of this Software may be reproduced in any form or by any means, electronic * or mechanical, including photocopying, without permission in writing from * Southwest Research Institute. All inquiries should be addressed to: * * Director of Contracts * Southwest Research Institute * P. O. Drawer 28510 * San Antonio, Texas 78228-0510 * * * Use of this Software is governed by the terms of the end user license * agreement, if any, which accompanies or is included with the Software * (the "License Agreement"). An end user will be unable to install any * Software that is accompanied by or includes a License Agreement, unless * the end user first agrees to the terms of the License Agreement. Except * as set forth in the applicable License Agreement, any further copying, * reproduction or distribution of this Software is expressly prohibited. * Installation assistance, product support and maintenance, if any, of the * Software is available from SwRI and/or the Third Party Providers, as the * case may be. * * Disclaimer of Warranty * * SOFTWARE IS WARRANTED, IF AT ALL, IN ACCORDANCE WITH THESE TERMS OF THE * LICENSE AGREEMENT. UNLESS OTHERWISE EXPLICITLY STATED, THIS SOFTWARE IS * PROVIDED "AS IS", IS EXPERIMENTAL, AND IS FOR NON-COMMERCIAL USE ONLY, * AND ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A PARTICULAR * PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED, EXCEPT TO THE EXTENT THAT * SUCH DISCLAIMERS ARE HELD TO BE LEGALLY INVALID. * * Limitation of Liability * * SwRI SHALL NOT BE LIABLE FOR ANY DAMAGES SUFFERED AS A RESULT OF USING, * MODIFYING, CONTRIBUTING, COPYING, DISTRIBUTING, OR DOWNLOADING THIS * SOFTWARE. IN NO EVENT SHALL SwRI BE LIABLE FOR ANY INDIRECT, PUNITIVE, * SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGE (INCLUDING LOSS OF BUSINESS, * REVENUE, PROFITS, USE, DATA OR OTHER ECONOMIC ADVANTAGE) HOWEVER IT ARISES, * WHETHER FOR BREACH OF IN TORT, EVEN IF SwRI HAS BEEN PREVIOUSLY ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE. YOU HAVE SOLE RESPONSIBILITY FOR ADEQUATE * PROTECTION AND BACKUP OF DATA AND/OR EQUIPMENT USED IN CONNECTION WITH THE * SOFTWARE AND WILL NOT MAKE A CLAIM AGAINST SwRI FOR LOST DATA, RE-RUN TIME, * INACCURATE OUTPUT, WORK DELAYS OR LOST PROFITS RESULTING FROM THE USE OF * THIS SOFTWARE. YOU AGREE TO HOLD SwRI HARMLESS FROM, AND YOU COVENANT NOT * TO SUE SwRI FOR, ANY CLAIMS BASED ON USING THE SOFTWARE. * * Local Laws: Export Control * * You acknowledge and agree this Software is subject to the U.S. Export * Administration Laws and Regulations. Diversion of such Software contrary * to U.S. law is prohibited. You agree that none of the Software, nor any * direct product therefrom, is being or will be acquired for, shipped, * transferred, or reexported, directly or indirectly, to proscribed or * embargoed countries or their nationals, nor be used for nuclear activities, * chemical biological weapons, or missile projects unless authorized by U.S. * Government. Proscribed countries are set forth in the U.S. Export * Administration Regulations. Countries subject to U.S embargo are: Cuba, * Iran, Iraq, Libya, North Korea, Syria, and the Sudan. This list is subject * to change without further notice from SwRI, and you must comply with the * list as it exists in fact. You certify that you are not on the U.S. * Department of Commerce's Denied Persons List or affiliated lists or on the * U.S. Department of Treasury's Specially Designated Nationals List. You agree * to comply strictly with all U.S. export laws and assume sole responsibilities * for obtaining licenses to export or reexport as may be required. * * General * * These Terms represent the entire understanding relating to the use of the * Software and prevail over any prior or contemporaneous, conflicting or * additional, communications. SwRI can revise these Terms at any time * without notice by updating this posting. * * Trademarks * * The SwRI logo is a trademark of SwRI in the United States and other countries. * */ #ident "@(#) $Id: row_con_ncyc.c 20785 2010-04-08 19:00:10Z carrie $ SwRI" #include "libIDFSFill.h" /***************************************************************************** * * * IDFSFILL_ROW_CONSTANT_NCYC SUBROUTINE * * * * DESCRIPTION * * This routine is called to fill a partially filled row of data that is * * identified as non-cyclic by projecting the known values both to the left * * and to the right. Initially the element norm values are: * * * * -1: untouchable element * * 0: unfilled element * * 1: filled element (good data) * * 2: filled element (estimated data) * * * * Only elements whose norm value is 0 can be filled and those that are * * filled have their norm value set to 2. The filling of empty elements * * between two known elements is a projection of data from the left most * * element outwards and the right most element inwards with the values * * meeting at the element midway between the two known elements. Unknown * * elements either to the right of the last known element or to the left of * * the first known element can be filled by projecting the first known * * element to the left or the last known element to the right. This only * * occurs if the input variable project is set to 1. * * * * INPUT VARIABLES * * SDDAS_FLOAT *dptr pointer to the first element in the data * * block that is to be examined * * SDDAS_CHAR *norm pointer to the first element in the bin * * status block to be examined * * SDDAS_CHAR project flag indicating if the data is to be * * projected to the end of the bins * * SDDAS_LONG ncol number of elements in a row of data * * SDDAS_LONG nscan number of elements in a column of data * * SDDAS_LONG need_filled number of filled bins needed to perform * * the calculations to determine the missing * * value * * * * USAGE * * IDFSFill_row_constant_ncyc (&dptr, &norm, ncol, nscan, need_filled, * * project) * * * * NECESSARY SUBPROGRAMS * * None * * * * EXTERNAL VARIABLES * * None * * * * INTERNAL VARIABLES * * register SDDAS_FLOAT *f1 pointer to the data values * * reg SDDAS_FLOAT *stop_loop loop termination variable * * register SDDAS_LONG a, b index variables * * register SDDAS_CHAR *c1 pointer to the bin status values * * SDDAS_FLOAT len number of bins the current value occupies * * SDDAS_FLOAT front contents of first known element * * SDDAS_FLOAT rear contents of last known element * * SDDAS_LONG i looping variable * * SDDAS_LONG ta index to fill missing bins * * SDDAS_LONG stop stop index between two known values * * SDDAS_LONG hstop midway point between two known values * * SDDAS_LONG end location of last filled data bin * * SDDAS_LONG loc_first index to first data bin with value * * SDDAS_LONG filled number of data bins with values * * SDDAS_LONG ind_val index variable * * * * SUBSYSTEM * * Display Level * * * ****************************************************************************/ void IDFSFill_row_constant_ncyc (SDDAS_FLOAT *dptr, SDDAS_CHAR *norm, SDDAS_LONG ncol, SDDAS_LONG nscan, SDDAS_LONG need_filled, SDDAS_CHAR project) { register SDDAS_FLOAT *f1, *stop_loop; register SDDAS_LONG a,b; register SDDAS_CHAR *c1; SDDAS_FLOAT len, front, rear; SDDAS_LONG i, ta, stop, hstop, end, loc_first = -1, filled = 0, ind_val; /****** HOW MANY FILLED VALUES ARE THERE? ******/ /****** AND WHERE IS THE FIRST ONE? ******/ for (a = 0, c1 = norm; a < ncol; ++a, c1 += nscan) { if (*c1 > 0) { ++filled; if (loc_first < 0) loc_first = a; } } /****** DO WE HAVE ENOUGH FILLED VALUES? ******/ if (filled < need_filled) return; /***************************************************************/ /* Fill in any empty slots prior to the first filled in bin */ /* if projection was selected. */ /***************************************************************/ b = loc_first * nscan; if (loc_first != 0 && project == 1) { c1 = norm; stop_loop = dptr + b; for (f1 = dptr; f1 < stop_loop; f1 += nscan, c1 += nscan) if (*c1 == 0) { *f1 = dptr[b]; *c1 = 2; } } /***************************************************************/ /* If the first data value found is the last element, simply */ /* return. */ /***************************************************************/ end = ncol - 1; a = loc_first + 1; if (a > end) return; f1 = dptr; c1 = norm; while (a != end) { /************************************************************/ /* Skip past non-empty bins. */ /************************************************************/ while ((*(c1+a*nscan) != 0) && (a != end)) ++a; /************************************************************/ /* Found an empty bin OR last bin is non-empty. */ /************************************************************/ if (a != end || *(c1 + a*nscan) > 0) { b = a - 1; len = 0.0; while ((*(c1+a*nscan) == 0) && (a != end)) { ++a; len += 1.0; } if (a != end || *(c1 + a*nscan) > 0) { stop = (SDDAS_LONG) (len + .5); hstop = stop / 2; front = *(f1 + b*nscan); rear = *(f1 + a*nscan); for ( i = 0; i < stop; ++i ) { ta = b + 1; ind_val = ta * nscan; if (*(c1 + ind_val) == 0) { *(f1 + ind_val) = (i < hstop) ? front : rear; *(c1 + ind_val) = 2; } b = ta; } } else { if (project == 1) { /* Start at 1st empty element after last filled in value. */ stop = nscan*ncol; c1 = norm + (b + 1) *nscan; f1 = dptr + (b + 1) *nscan; stop_loop = dptr + stop; for (; f1 < stop_loop; f1 += nscan, c1 += nscan) if (*c1 == 0) { *f1 = dptr[b*nscan]; *c1 = 2; } } } } else { ind_val = a * nscan; if (project == 1 && norm[ind_val] == 0) { dptr[ind_val] = dptr[(a-1)*nscan]; norm[ind_val] = 2; } } } }