You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
80 lines
3.1 KiB
80 lines
3.1 KiB
//==============================================================================
|
|
//
|
|
// File: dv.h
|
|
// Date: 02/04/01
|
|
// Author: Dave Parker
|
|
// Desc: Header file for C++ code for double vector stuff
|
|
//
|
|
//------------------------------------------------------------------------------
|
|
//
|
|
// Copyright (c) 2002, Dave Parker
|
|
//
|
|
// This file is part of PRISM.
|
|
//
|
|
// PRISM is free software; you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// PRISM is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with PRISM; if not, write to the Free Software Foundation,
|
|
// Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
//
|
|
//==============================================================================
|
|
|
|
#ifndef DV_H
|
|
#define DV_H
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
#include <util.h>
|
|
#include <cudd.h>
|
|
#include <odd.h>
|
|
|
|
// constants
|
|
|
|
#define DV_GREATER_THAN_EQUALS 1
|
|
#define DV_GREATER_THAN 2
|
|
#define DV_LESS_THAN_EQUALS 3
|
|
#define DV_LESS_THAN 4
|
|
#define DV_INTERVAL 5
|
|
|
|
// distinct vectors
|
|
|
|
typedef struct DistVector DistVector;
|
|
|
|
struct DistVector
|
|
{
|
|
double *dist;
|
|
int num_dist;
|
|
unsigned short *ptrs;
|
|
};
|
|
|
|
// function prototypes
|
|
|
|
double *mtbdd_to_double_vector(DdManager *ddman, DdNode *dd, DdNode **vars, int num_vars, ODDNode *odd);
|
|
double *mtbdd_to_double_vector(DdManager *ddman, DdNode *dd, DdNode **vars, int num_vars, ODDNode *odd, double *res);
|
|
DdNode *double_vector_to_mtbdd(DdManager *ddman, double *vec, DdNode **vars, int num_vars, ODDNode *odd);
|
|
DdNode *double_vector_to_bdd(DdManager *ddman, double *vec, int rel_op, double bound, DdNode **vars, int num_vars, ODDNode *odd);
|
|
DdNode *double_vector_to_bdd(DdManager *ddman, double *vec, int rel_op, double bound1, double bound2, DdNode **vars, int num_vars, ODDNode *odd);
|
|
|
|
void filter_double_vector(DdManager *ddman, double *vec, DdNode *filter, DdNode **vars, int num_vars, ODDNode *odd);
|
|
double get_first_from_bdd(DdManager *ddman, double *vec, DdNode *filter, DdNode **vars, int num_vars, ODDNode *odd);
|
|
double min_double_vector_over_bdd(DdManager *ddman, double *vec, DdNode *filter, DdNode **vars, int num_vars, ODDNode *odd);
|
|
double max_double_vector_over_bdd(DdManager *ddman, double *vec, DdNode *filter, DdNode **vars, int num_vars, ODDNode *odd);
|
|
double sum_double_vector_over_bdd(DdManager *ddman, double *vec, DdNode *filter, DdNode **vars, int num_vars, ODDNode *odd);
|
|
double sum_double_vector_over_mtbdd(DdManager *ddman, double *vec, DdNode *mult, DdNode **vars, int num_vars, ODDNode *odd);
|
|
|
|
DistVector *double_vector_to_dist(double *v, int n);
|
|
void free_dist_vector(DistVector *dv);
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
#endif
|
|
|
|
//------------------------------------------------------------------------------
|