summaryrefslogtreecommitdiffstats
path: root/jni/feature_stab/db_vlvm/db_utilities_indexing.h
diff options
context:
space:
mode:
Diffstat (limited to 'jni/feature_stab/db_vlvm/db_utilities_indexing.h')
-rw-r--r--jni/feature_stab/db_vlvm/db_utilities_indexing.h270
1 files changed, 0 insertions, 270 deletions
diff --git a/jni/feature_stab/db_vlvm/db_utilities_indexing.h b/jni/feature_stab/db_vlvm/db_utilities_indexing.h
deleted file mode 100644
index 01eeb9ea2..000000000
--- a/jni/feature_stab/db_vlvm/db_utilities_indexing.h
+++ /dev/null
@@ -1,270 +0,0 @@
-/*
- * Copyright (C) 2011 The Android Open Source Project
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-/* $Id: db_utilities_indexing.h,v 1.3 2011/06/17 14:03:31 mbansal Exp $ */
-
-#ifndef DB_UTILITIES_INDEXING
-#define DB_UTILITIES_INDEXING
-
-
-
-/*****************************************************************
-* Lean and mean begins here *
-*****************************************************************/
-
-#include "db_utilities.h"
-
-/*!
- * \defgroup LMIndexing (LM) Indexing Utilities (Order Statistics, Matrix Operations)
- */
-/*\{*/
-
-inline void db_SetupMatrixRefs(double **ar,long rows,long cols,double *a)
-{
- long i;
- for(i=0;i<rows;i++) ar[i]=&a[i*cols];
-}
-
-inline void db_SymmetricExtendUpperToLower(double **A,int rows,int cols)
-{
- int i,j;
- for(i=1;i<rows;i++) for(j=0;j<i;j++) A[i][j]=A[j][i];
-}
-
-void inline db_MultiplyMatrixVectorAtb(double *c,const double * const *At,const double *b,int arows,int acols)
-{
- int i,j;
- double acc;
-
- for(i=0;i<arows;i++)
- {
- acc=0;
- for(j=0;j<acols;j++) acc+=At[j][i]*b[j];
- c[i]=acc;
- }
-}
-
-inline void db_MultiplyMatricesAB(double **C,const double * const *A,const double * const *B,int arows,int acols,int bcols)
-{
- int i,j,k;
- double acc;
-
- for(i=0;i<arows;i++) for(j=0;j<bcols;j++)
- {
- acc=0;
- for(k=0;k<acols;k++) acc+=A[i][k]*B[k][j];
- C[i][j]=acc;
- }
-}
-
-inline void db_UpperMultiplyMatricesAtB(double **Cu,const double * const *At,const double * const *B,int arows,int acols,int bcols)
-{
- int i,j,k;
- double acc;
-
- for(i=0;i<arows;i++) for(j=i;j<bcols;j++)
- {
- acc=0;
- for(k=0;k<acols;k++) acc+=At[k][i]*B[k][j];
- Cu[i][j]=acc;
- }
-}
-
-DB_API void db_Zero(double *d,long nr);
-
-inline int db_MaxIndex2(double s[2])
-{
- if(s[0]>=s[1]) return(0);
- return(1);
-}
-
-inline int db_MaxIndex3(const double s[3])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]>best){best=s[1];pos=1;}
- if(s[2]>best){best=s[2];pos=2;}
- return(pos);
-}
-
-inline int db_MaxIndex4(const double s[4])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]>best){best=s[1];pos=1;}
- if(s[2]>best){best=s[2];pos=2;}
- if(s[3]>best){best=s[3];pos=3;}
- return(pos);
-}
-
-inline int db_MaxIndex5(const double s[5])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]>best){best=s[1];pos=1;}
- if(s[2]>best){best=s[2];pos=2;}
- if(s[3]>best){best=s[3];pos=3;}
- if(s[4]>best){best=s[4];pos=4;}
- return(pos);
-}
-
-inline int db_MaxIndex6(const double s[6])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]>best){best=s[1];pos=1;}
- if(s[2]>best){best=s[2];pos=2;}
- if(s[3]>best){best=s[3];pos=3;}
- if(s[4]>best){best=s[4];pos=4;}
- if(s[5]>best){best=s[5];pos=5;}
- return(pos);
-}
-
-inline int db_MaxIndex7(const double s[7])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]>best){best=s[1];pos=1;}
- if(s[2]>best){best=s[2];pos=2;}
- if(s[3]>best){best=s[3];pos=3;}
- if(s[4]>best){best=s[4];pos=4;}
- if(s[5]>best){best=s[5];pos=5;}
- if(s[6]>best){best=s[6];pos=6;}
- return(pos);
-}
-
-inline int db_MinIndex7(const double s[7])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]<best){best=s[1];pos=1;}
- if(s[2]<best){best=s[2];pos=2;}
- if(s[3]<best){best=s[3];pos=3;}
- if(s[4]<best){best=s[4];pos=4;}
- if(s[5]<best){best=s[5];pos=5;}
- if(s[6]<best){best=s[6];pos=6;}
- return(pos);
-}
-
-inline int db_MinIndex9(const double s[9])
-{
- double best;
- int pos;
-
- best=s[0];pos=0;
- if(s[1]<best){best=s[1];pos=1;}
- if(s[2]<best){best=s[2];pos=2;}
- if(s[3]<best){best=s[3];pos=3;}
- if(s[4]<best){best=s[4];pos=4;}
- if(s[5]<best){best=s[5];pos=5;}
- if(s[6]<best){best=s[6];pos=6;}
- if(s[7]<best){best=s[7];pos=7;}
- if(s[8]<best){best=s[8];pos=8;}
- return(pos);
-}
-
-inline int db_MaxAbsIndex3(const double *s)
-{
- double t,best;
- int pos;
-
- best=fabs(s[0]);pos=0;
- t=fabs(s[1]);if(t>best){best=t;pos=1;}
- t=fabs(s[2]);if(t>best){pos=2;}
- return(pos);
-}
-
-inline int db_MaxAbsIndex9(const double *s)
-{
- double t,best;
- int pos;
-
- best=fabs(s[0]);pos=0;
- t=fabs(s[1]);if(t>best){best=t;pos=1;}
- t=fabs(s[2]);if(t>best){best=t;pos=2;}
- t=fabs(s[3]);if(t>best){best=t;pos=3;}
- t=fabs(s[4]);if(t>best){best=t;pos=4;}
- t=fabs(s[5]);if(t>best){best=t;pos=5;}
- t=fabs(s[6]);if(t>best){best=t;pos=6;}
- t=fabs(s[7]);if(t>best){best=t;pos=7;}
- t=fabs(s[8]);if(t>best){best=t;pos=8;}
- return(pos);
-}
-
-
-/*!
-Select ordinal pos (zero based) out of nr_elements in s.
-temp should point to alloced memory of at least nr_elements*2
-Optimized runtimes on 450MHz:
-\code
- 30 with 3 microsecs
- 100 with 11 microsecs
- 300 with 30 microsecs
- 500 with 40 microsecs
-1000 with 100 microsecs
-5000 with 540 microsecs
-\endcode
-so the expected runtime is around
-(nr_elements/10) microseconds
-The total quickselect cost of splitting 500 hypotheses recursively
-is thus around 100 microseconds
-
-Does the same operation as std::nth_element().
-*/
-DB_API double db_LeanQuickSelect(const double *s,long nr_elements,long pos,double *temp);
-
-/*!
- Median of 3 doubles
- */
-inline double db_TripleMedian(double a,double b,double c)
-{
- if(a>b)
- {
- if(c>a) return(a);
- else if(c>b) return(c);
- else return(b);
- }
- else
- {
- if(c>b) return(b);
- else if(c>a) return(c);
- else return(a);
- }
-}
-
-/*!
-Align float pointer to nr_bytes by moving forward
-*/
-DB_API float* db_AlignPointer_f(float *p,unsigned long nr_bytes);
-
-/*!
-Align short pointer to nr_bytes by moving forward
-*/
-DB_API short* db_AlignPointer_s(short *p,unsigned long nr_bytes);
-
-#endif /* DB_UTILITIES_INDEXING */
generated by cgit v1.2.3 (git 2.25.1) at 2024-04-27 22:12:40 +0000