use serde::{Deserialize, Serialize};
use std::collections::BTreeMap;
/// This object represents an update that can't be parsed.
/// # Documentation
/// <https://core.telegram.org/bots/api#update>
#[derive(Clone, Debug, Serialize, Deserialize)]
pub struct UpdateUnparsed {
/// The update's unique identifier. Update identifiers start from a certain positive number and increase sequentially. This identifier becomes especially handy if you're using webhooks, since it allows you to ignore repeated updates or to restore the correct update sequence, should they get out of order. If there are no new updates for at least a week, then identifier of the next update will be chosen randomly instead of sequentially.
pub update_id: i64,
#[serde(flatten)]
pub extra: BTreeMap<Box<str>, serde_json::Value>,
}
impl UpdateUnparsed {
/// Creates a new `UpdateUnparsed`.
///
/// # Arguments
/// * `update_id` - The update's unique identifier. Update identifiers start from a certain positive number and increase sequentially. This identifier becomes especially handy if you're using webhooks, since it allows you to ignore repeated updates or to restore the correct update sequence, should they get out of order. If there are no new updates for at least a week, then identifier of the next update will be chosen randomly instead of sequentially.
#[must_use]
pub fn new<T0: Into<i64>>(update_id: T0) -> Self {
Self {
update_id: update_id.into(),
extra: BTreeMap::new(),
}
}
/// The update's unique identifier. Update identifiers start from a certain positive number and increase sequentially. This identifier becomes especially handy if you're using webhooks, since it allows you to ignore repeated updates or to restore the correct update sequence, should they get out of order. If there are no new updates for at least a week, then identifier of the next update will be chosen randomly instead of sequentially.
#[must_use]
pub fn update_id<T: Into<i64>>(self, val: T) -> Self {
let mut this = self;
this.update_id = val.into();
this
}
}