BQStructs.H

Go to the documentation of this file.

/**************************************
 *File: BQStructs.H
 *Authors: dspinosa, relminya
 *Date:   3.15.2005
 *
 *Description: Basic structs that 
 * BikeQuest DB, AI, UI will use as 
 * data ferries.See structsexplained.JPG
 * for a picture of how this all works.
 **************************************/

#ifndef BQStructs_h
#define BQStructs_h

#include <iostream>
#include <string>
#include <map>
#include <limits.h>
#include <vector>

//include incase multimap approach to 
//qualitative ratings is used.
using namespace std;

enum QualitativeRatings {POSHAZ, NEGHAZ, POSAMEN, NEGAMEN, POSSCEN, NEGSCEN, POSOTHER, NEGOTHER};

typedef pair<int, string> entry;


/**************************************
 * Struct: userPreferences
 * Author: dspinosa
 * Date: 3.24.05
 * typedef: userPrefs_t
 *
 * Description:  holds all user preferences that can be entered
 * at the GUI and used by searchParser and pathSearchAI
 *
 *  ** Will be set to DONT_CARE if the user doesnt care **
 *************************************/
typedef struct userPreferences{
  double shoulderPref;
  double trafficPref;
  double conditionPref;
  double steepnessPref; 
} userPrefs_t;

#define DONT_CARE LONG_MAX

typedef std::pair<double, double> segpt;

typedef struct segComponents{
  std::vector<segpt*>* points;
  std::string roadname;
  int roadtype;
} segComps_t;

/**************************************
 *Struct: intersection
 *Author: relminya
 *Date:   3.15.2005
 *Typedef: isect_t
 *
 *Description: All points where >=2 roads meet
 * are defined to be intersections. Pointer
 * to nextIntersection is part of singly linked list
 * implementation that is used in describing a whole
 * path.
 *
 **************************************/
typedef struct intersection isect_t;

struct intersection{
  double x, y;
  isect_t* nextIntersection;
};

/**************************************
 *Struct: streetSeg
 *Author: relminya
 *Date:   3.15.2005
 *Typedef: seg_t
 *
 *Description: Basic building block of BQ. 
 * These are the road section descriptors
 * that are easily culled from GIS data.
 * Any modifications to this after 3.15.2005
 * will be *adds* ... data such as traffic
 * and elevation are possibilities for addition.
 * Struct will be finalized when tables are 
 * created in postgreSQL, as the mapdata table
 * and rankings tables will follow this struct
 * closely for columns.
 **************************************/

typedef struct streetSeg{
  int routeid;
  string streetName;
  int streetType; //possibly could be enum as this is 9 types as defined by cnty-class
                     //in e00 file see http://www.edc.uri.edu/rigis-spf/Metadata/Transportation/s44trd98.html
  string town;
  string state;
  string startzipCode; //because of leading 0s we should make this a string
  string endzipCode;
  isect_t* start;
  isect_t* end;
  double streetAddressStart;
  double streetAddressEnd;
  bool bikeable;
  double length;
  //Quantitative Rankings
  double shoulderRating;//feedback averages
  double trafficRating;
  double conditionRating;
  double steepnessRating;
  int shoulderTotal;//quantity of feedback
  int trafficTotal;
  int conditionTotal;
  int steepnessTotal;
  //Qualitative Rankings
  multimap<int, string>* qualitativeRankings;
}seg_t;

/**************************************
 *Struct:  pathDesc
 *Author:  relminya
 *Date:    3.15.2005
 *Typedef: path_t
 *
 *Description: Singly Linked List implementation
 * that describes a path, will mainly be used
 * by AI. Nodes are streetsegs, links are isects.
 ****************************************/

typedef struct pathDesc{
  seg_t* begin;
  seg_t* end;
  isect_t* nextIntersection;
}path_t;


#endif

---