Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
kvalobs:kvalobs:generisk [2008-08-28 07:30:15]
paule created
kvalobs:kvalobs:generisk [2023-09-18 12:01:24]
terjeer removed
Line 3: Line 3:
 The consistency checks QC1-2 and QC1-6 is run on perl algorithms. Most of these are written to fit a specific situation. There is also a number of generic algorithms that are used as such in several different checks. The generic algorithms are the following: The consistency checks QC1-2 and QC1-6 is run on perl algorithms. Most of these are written to fit a specific situation. There is also a number of generic algorithms that are used as such in several different checks. The generic algorithms are the following:
  
-|  **name**  |  **parameters**  |  **implementation**  |  **example use**  |+|  **name**  |  **parameters**  |  **implementation**\\ return of flag value=3 when   **example use**  |
 |eq_between.pl|obs;X,Y;;%%|%%meta;X_C,Y_LO,Y_HI;;|$X[0] == $X_C[0]) && ($Y[0] ≥ $Y_LO[0]) && ($Y[0] ≤ $Y_HI[0]|QC1-2-137\\  QC1-6-328| |eq_between.pl|obs;X,Y;;%%|%%meta;X_C,Y_LO,Y_HI;;|$X[0] == $X_C[0]) && ($Y[0] ≥ $Y_LO[0]) && ($Y[0] ≤ $Y_HI[0]|QC1-2-137\\  QC1-6-328|
 |eq_uneq.pl|obs;X,Y;;%%|%%meta;X_CX,Y_CY;;|$X[0] == $X_CX[0]) && ($Y[0] != $Y_CY[0]|QC1-2-42\\  QC1-6-278| |eq_uneq.pl|obs;X,Y;;%%|%%meta;X_CX,Y_CY;;|$X[0] == $X_CX[0]) && ($Y[0] != $Y_CY[0]|QC1-2-42\\  QC1-6-278|
Line 15: Line 15:
 |min_gt.pl|obs;X1,X2;;%%|%%meta;R1;;|the array X2less is X2 excluded missing values;\\  @X2less = sort{$a <=> $b} @X2less;\\  $X1[0] < $X2less[0] + $R1[0]|QC1-6-211\\  QC1-6-212| |min_gt.pl|obs;X1,X2;;%%|%%meta;R1;;|the array X2less is X2 excluded missing values;\\  @X2less = sort{$a <=> $b} @X2less;\\  $X1[0] < $X2less[0] + $R1[0]|QC1-6-211\\  QC1-6-212|
 |min_lt.pl|obs;X1,X2;;%%|%%meta;R1;;|the array X2less is X2 excluded missing value;\\  @X2less = sort{$a <=> $b} @X2less;\\  $X1[0] > $X2less[0] + $R1[0]|QC1-2-35| |min_lt.pl|obs;X1,X2;;%%|%%meta;R1;;|the array X2less is X2 excluded missing value;\\  @X2less = sort{$a <=> $b} @X2less;\\  $X1[0] > $X2less[0] + $R1[0]|QC1-2-35|
-|notbetween_between.pl|obs;X1,X2;;%%|%%meta;R1,R2,R3,R4;;|$X1[0] < $R1[0] %%|%%%%|%% $X1[0] > $R2[0]) && ($X2[0] ≥ $R3[0] && $X2[0] ≤ $R4[0]|QC1-6-281\\  QC1-6-295| +|notbetween_between.pl|obs;X,Y;;%%|%%meta;X_C1,X_C2,Y_C1,Y_C2;;|($X[0] < $X_C1[0] %%|%%%%|%% $X[0] > $X_C2[0]) && ($Y[0] ≥ $Y_C1[0] && $Y[0] ≤ $Y_C2[0])|QC1-6-281\\  QC1-6-295| 
 +|between_between.pl|obs;X,Y;;%%|%%meta;X_C1,X_C2,Y_C1,Y_C2;;|$X[0] ≥ $X_C1[0] && $X[0] ≤  $X_C2[0] && $Y[0] ≥ $Y_C1[0] && $Y[0] ≤ $Y_C2[0]|QC1-6-296\\ QC1-6-313|
    
  
-Last modifiedFri Apr 29 08:06:00 GMT 2005  + --- //[[gabriel.kielland@met.no|Gabriel Kielland]] 2010/10/14 15:55//
- +
- +
- +