{Name: "subquery_having_2", Age: 20},
		{Name: "subquery_having_3", Age: 30},
		{Name: "subquery_having_4", Age: 40},
	}
	DB.Create(&users)

	var results []User
	DB.Select("AVG(age) as avgage").Where("name LIKE ?", "subquery_having%").Group("name").Having("AVG(age) > (?)", DB.
		Select("AVG(age)").Where("name LIKE ?", "subquery_having%").Table("users")).Find(&results)

	if len(results) != 2 {

labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message

labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message

				"application/vnd.nokia.landmark+wbxml",
				"application/vnd.nokia.landmark+xml",
				"application/vnd.nokia.landmarkcollection+xml",
				"application/vnd.nokia.n-gage.ac+xml",
				"application/vnd.nokia.n-gage.data",
				"application/vnd.nokia.n-gage.symbian.install",
				"application/vnd.nokia.ncd",
				"application/vnd.nokia.pcd+wbxml",
				"application/vnd.nokia.pcd+xml",
				"application/vnd.nokia.radio-preset",

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to