#![allow(dead_code)]
use super::GenCtx;
use rand::prelude::*;
pub struct SellOrder {
pub quantity: f32,
pub price: f32,
pub q_sold: f32,
}
pub struct BuyOrder {
quantity: f32,
max_price: f32,
}
#[derive(Clone, Debug)]
pub struct Belief {
pub price: f32,
pub confidence: f32,
}
impl Belief {
pub fn choose_price(&self, ctx: &mut GenCtx<impl Rng>) -> f32 {
self.price + ctx.rng.gen_range(-1.0..1.0) * self.confidence
}
pub fn update_buyer(&mut self, _years: f32, new_price: f32) {
if (self.price - new_price).abs() < self.confidence {
self.confidence *= 0.8;
} else {
self.price += (new_price - self.price) * 0.5; self.confidence = (self.price - new_price).abs();
}
}
pub fn update_seller(&mut self, proportion: f32) {
self.price *= 1.0 + (proportion - 0.5) * 0.25;
self.confidence /= 1.0 + (proportion - 0.5) * 0.25;
}
}
pub fn buy_units<'a>(
_ctx: &mut GenCtx<impl Rng>,
sellers: impl Iterator<Item = &'a mut SellOrder>,
max_quantity: f32,
max_price: f32,
max_spend: f32,
) -> (f32, f32) {
let mut sell_orders = sellers.filter(|so| so.quantity > 0.0).collect::<Vec<_>>();
sell_orders.sort_by(|a, b| {
a.price
.partial_cmp(&b.price)
.unwrap_or_else(|| panic!("{} and {}", a.price, b.price))
});
let mut quantity = 0.0;
let mut spent = 0.0;
for order in sell_orders {
if quantity >= max_quantity || spent >= max_spend || order.price > max_price
{
break;
} else {
let q = (max_quantity - quantity)
.min(order.quantity - order.q_sold)
.min((max_spend - spent) / order.price);
order.q_sold += q;
quantity += q;
spent += q * order.price;
}
}
(quantity, spent)
}