-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Co-authored-by: Chris <[email protected]>
- Loading branch information
1 parent
744a783
commit 6cb8a76
Showing
8 changed files
with
11,305 additions
and
469 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,188 @@ | ||
| package models | ||
|
|
||
| import ( | ||
| "fmt" | ||
| "strconv" | ||
| "strings" | ||
| ) | ||
|
|
||
| type SortAndFilter struct { | ||
| filterMap map[string]FilterBy | ||
| } | ||
|
|
||
| func (s *SortAndFilter) Make() SortAndFilter { | ||
| filterMap := map[string]FilterBy { | ||
| "PriceLessThan" : &PriceLessThan{}, | ||
| "RatingGreaterThan" : &RatingGreaterThan{}, | ||
| } | ||
| return SortAndFilter{filterMap: filterMap} | ||
| } | ||
|
|
||
| // assumes a non-empty list of filters, list of strings is case sensitive | ||
| func (s *SortAndFilter) ConstructFilterQuery(filters []string) string { | ||
| // based on list of strings for filters construct SQL WHERE queries to filter database based on certain parameters | ||
| if len(filters) == 0 { | ||
| return `` | ||
| } | ||
|
|
||
| query := `WHERE ` | ||
| for i := range filters { | ||
| // map each given filter to its associated object | ||
| filter := filters[i] // get filter | ||
| index := strings.Index(filter, " ") // check if the filter has parameters/get the index for the command | ||
| command := filter | ||
| if index != -1 { // if the filter command has a parameter | ||
| command = filter[0:index] | ||
| parameter := filter[index + 1:] // extract parameter for the filter | ||
| s.filterMap[command].Set(parameter) // set the parameter for the query | ||
| } | ||
| // get the string for that object and concate WHERE command to query string | ||
| query += s.filterMap[command].WhereQuery() | ||
| if i + 1 < len(filters) { | ||
| query += ` AND ` | ||
| } | ||
| } | ||
| return query | ||
| } | ||
|
|
||
| // assumes input is a non-empty string and one of the possible sort types, case sensitive | ||
| func (s *SortAndFilter) SortVenues(input string) string { | ||
| if input == `` { | ||
| return `` | ||
| } | ||
| // parse given input string to get sort string value and possible parameters for the sort | ||
| index := strings.Index(input, " ") | ||
| command := input | ||
| if index != -1 { // if the sort has a parameter | ||
| command = input[0:index] | ||
| } | ||
| // create sort object and sort array of venues based on sort | ||
| createdSort := s.createSort(command, input, index) | ||
| return createdSort.SortQuery() | ||
| } | ||
|
|
||
| // takes in an array of venues to sort, command string determing what sort we want to create, input string storing that commands parameters, and index of the first space is applicable | ||
| func (s *SortAndFilter) createSort(command string, input string, index int) SortBy { | ||
| if command == "ByDistance" { // format: ByDistance long lat | ||
| // parse location to check distance from | ||
| lastIndex := strings.LastIndex(input, " ") | ||
| long, err := strconv.ParseFloat(input[index + 1: lastIndex], 64) | ||
| if err != nil { | ||
| fmt.Println("Formatting error Long " + err.Error()) | ||
| } | ||
| lat, err := strconv.ParseFloat(input[lastIndex + 1:], 64) | ||
| if err != nil { | ||
| fmt.Println("Formatting error Lat " + err.Error()) | ||
| } | ||
| s := ByDistance{long, lat} | ||
| return &s | ||
| } else if command == `ByRecommendation`{ | ||
| arr := strings.Split(input, " ") | ||
| return &ByRecommendation{arr[1]} | ||
| } else if command == `ByPrice` { | ||
| return &ByPrice{} | ||
| } else if command == `ByRating` { | ||
| return &ByRating{} | ||
| } | ||
| return &ByDistance{} // throw an error/return blank sort or something | ||
| } | ||
|
|
||
| // SORT TYPES | ||
|
|
||
| // NOTE: ALSO REORGANIZE FHEIWQHIO | ||
|
|
||
| type SortBy interface { | ||
| // returns a string for calculating a parameter to sort by (empty if sorting by defined venue parameter) | ||
| // order by string, determines what order to sort the array in | ||
| SortQuery() string | ||
| } | ||
|
|
||
| type ByDistance struct { | ||
| long float64 | ||
| lat float64 | ||
| } | ||
|
|
||
| func (s *ByDistance) SortQuery() string { | ||
| return fmt.Sprintf(`ORDER BY 6371 * 2 * ASIN(SQRT( | ||
| POWER(SIN((%f - ST_Y(location::geometry)) * PI() / 180 / 2), 2) + | ||
| COS(%f * PI() / 180) * COS(ST_Y(location::geometry) * PI() / 180) * | ||
| POWER(SIN((%f - ST_X(location::geometry)) * PI() / 180 / 2), 2)))`, s.lat, s.lat, s.long) | ||
| } | ||
|
|
||
| type ByPrice struct {} | ||
|
|
||
| func (s *ByPrice) SortQuery() string { | ||
| return `ORDER BY price` | ||
| } | ||
|
|
||
| type ByRating struct {} | ||
|
|
||
| func (s *ByRating) SortQuery() string { | ||
| return `ORDER BY total_rating` | ||
| } | ||
|
|
||
| type ByRecommendation struct { | ||
| personality string | ||
| } | ||
|
|
||
| func (s *ByRecommendation) SortQuery() string { | ||
| // user personalities will be measured as the 4 preferences split among a weight of 1 | ||
| // for each venue calculate the average of each preference out of 10 | ||
| // from the average calculation get a total overall rating and get the weight of each preference from that overall | ||
| // calculate the difference from the weights of the user higher score and sum them up, further away from what the user wants | ||
| query := ` | ||
| ORDER BY | ||
| ( ABS( ((avg_energy / (avg_energy + avg_exclusive + avg_mainstream + avg_price)) - %f) ) + | ||
| ABS( ((avg_exclusive / (avg_energy + avg_exclusive + avg_mainstream + avg_price)) - %f) )) + | ||
| ABS( ((avg_mainstream / (avg_energy + avg_exclusive + avg_mainstream + avg_price)) - %f) ) + | ||
| ABS( ((avg_price / (avg_energy + avg_exclusive + avg_mainstream + avg_price)) - %f) ) | ||
| ` | ||
| vals := s.CharacterMap()[s.personality] | ||
| return fmt.Sprintf(query, vals[0], vals[1], vals[2], vals[3]) | ||
| } | ||
|
|
||
| func (s *ByRecommendation) CharacterMap() map[string][]float32 { | ||
| return map[string][]float32 { | ||
| // energy, exclusive, mainstream, price | ||
| `plumehart` : {.05, .3, .05, .6}, | ||
| `serafina` : {.1, .2, .1, .5}, | ||
| `buckley`: {.3, .1, .4, .1}, | ||
| `roux`: {.2, .1, .4, .3}, | ||
| `sprig`: {.4, .1, .4, .2}, | ||
| `blitz`: {.7, 0, .2, .1}, | ||
| `lumi`: {.6, .2, .2, 0}, | ||
| } | ||
| } | ||
|
|
||
| // NOTE TO SELF - REORGANIZE PLZ | ||
|
|
||
| // FILTER TYPES: | ||
|
|
||
| type FilterBy interface { | ||
| WhereQuery() string // return the WHERE command to be passed into the SQL query | ||
| Set(v string) // assigns parameter within struct for filter command | ||
| } | ||
|
|
||
| type PriceLessThan struct { | ||
| price string | ||
| } | ||
|
|
||
| func (f *PriceLessThan) WhereQuery() string { | ||
| return `price < ` + f.price | ||
| } | ||
|
|
||
| func (f *PriceLessThan) Set(price string) { | ||
| f.price = price | ||
| } | ||
|
|
||
| type RatingGreaterThan struct { | ||
| rating string | ||
| } | ||
|
|
||
| func (f *RatingGreaterThan) WhereQuery() string { | ||
| return `total_rating > ` + f.rating | ||
| } | ||
|
|
||
| func (f *RatingGreaterThan) Set(rating string) { | ||
| f.rating = rating | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.