rune/runtime/object.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587
use core::borrow;
use core::cmp;
use core::fmt;
use core::hash;
use core::iter;
use crate as rune;
use crate::alloc::hash_map;
use crate::alloc::hashbrown::raw::RawIter;
use crate::alloc::prelude::*;
use crate::alloc::{self, String};
use crate::runtime::{
FieldMap, FromValue, ProtocolCaller, RawAnyGuard, Ref, ToValue, Value, VmError, VmResult,
};
use crate::Any;
/// An owning iterator over the entries of a `Object`.
///
/// This `struct` is created by the [`into_iter`] method on [`Object`]
/// (provided by the `IntoIterator` trait). See its documentation for more.
///
/// [`into_iter`]: struct.Object.html#method.into_iter
/// [`Object`]: struct.Object.html
pub type IntoIter = hash_map::IntoIter<String, Value>;
/// A mutable iterator over the entries of a `Object`.
///
/// This `struct` is created by the [`iter_mut`] method on [`Object`]. See its
/// documentation for more.
///
/// [`iter_mut`]: struct.Object.html#method.iter_mut
/// [`Object`]: struct.Object.html
pub type IterMut<'a> = hash_map::IterMut<'a, String, Value>;
/// An iterator over the entries of a `Object`.
///
/// This `struct` is created by the [`iter`] method on [`Object`]. See its
/// documentation for more.
///
/// [`iter`]: struct.Object.html#method.iter
/// [`Object`]: struct.Object.html
pub type Iter<'a> = hash_map::Iter<'a, String, Value>;
/// An iterator over the keys of a `HashMap`.
///
/// This `struct` is created by the [`keys`] method on [`Object`]. See its
/// documentation for more.
///
/// [`keys`]: struct.Object.html#method.keys
/// [`Object`]: struct.Object.html
pub type Keys<'a> = hash_map::Keys<'a, String, Value>;
/// An iterator over the values of a `HashMap`.
///
/// This `struct` is created by the [`values`] method on [`Object`]. See its
/// documentation for more.
///
/// [`values`]: struct.Object.html#method.values
/// [`Object`]: struct.Object.html
pub type Values<'a> = hash_map::Values<'a, String, Value>;
/// Struct representing a dynamic anonymous object.
///
/// # Rust Examples
///
/// ```rust
/// use rune::alloc::String;
///
/// let mut object = rune::runtime::Object::new();
/// assert!(object.is_empty());
///
/// object.insert_value(String::try_from("foo")?, 42).into_result()?;
/// object.insert_value(String::try_from("bar")?, true).into_result()?;
/// assert_eq!(2, object.len());
///
/// assert_eq!(Some(42), object.get_value("foo").into_result()?);
/// assert_eq!(Some(true), object.get_value("bar").into_result()?);
/// assert_eq!(None::<bool>, object.get_value("baz").into_result()?);
/// # Ok::<_, rune::support::Error>(())
/// ```
#[derive(Any, Default)]
#[repr(transparent)]
#[rune(item = ::std::object)]
pub struct Object {
inner: FieldMap<String, Value>,
}
impl Object {
/// Construct a new object.
///
/// # Examples
///
/// ```rune
/// let object = Object::new();
/// object.insert("Hello", "World");
/// ```
#[inline]
#[rune::function(keep, path = Self::new)]
pub fn new() -> Self {
Self {
inner: crate::runtime::new_field_map(),
}
}
/// Construct a new object with the given capacity.
///
/// # Examples
///
/// ```rune
/// let object = Object::with_capacity(16);
/// object.insert("Hello", "World");
/// ```
#[inline]
#[rune::function(path = Self::with_capacity)]
pub(crate) fn rune_with_capacity(capacity: usize) -> VmResult<Self> {
VmResult::Ok(vm_try!(Self::with_capacity(capacity)))
}
/// Construct a new object with the given capacity.
pub fn with_capacity(capacity: usize) -> alloc::Result<Self> {
// BTreeMap doesn't support setting capacity on creation but we keep
// this here in case we want to switch store later.
Ok(Self {
inner: crate::runtime::new_field_hash_map_with_capacity(capacity)?,
})
}
/// Returns the number of elements in the object.
///
/// # Examples
///
/// ```rune
/// let object = Object::with_capacity(16);
/// object.insert("Hello", "World");
/// assert_eq!(object.len(), 1);
/// ```
#[inline]
#[rune::function(keep)]
pub fn len(&self) -> usize {
self.inner.len()
}
/// Returns `true` if the object is empty.
///
/// # Examples
///
/// ```rune
/// let object = Object::with_capacity(16);
/// assert!(object.is_empty());
/// object.insert("Hello", "World");
/// assert!(!object.is_empty());
/// ```
#[inline]
#[rune::function(keep)]
pub fn is_empty(&self) -> bool {
self.inner.is_empty()
}
/// Returns a reference to the value corresponding to the key.
#[inline]
pub fn get<Q>(&self, k: &Q) -> Option<&Value>
where
String: borrow::Borrow<Q>,
Q: ?Sized + hash::Hash + cmp::Eq + cmp::Ord,
{
self.inner.get(k)
}
/// Get the given value at the given index.
pub fn get_value<Q, T>(&self, k: &Q) -> VmResult<Option<T>>
where
String: borrow::Borrow<Q>,
Q: ?Sized + hash::Hash + cmp::Eq + cmp::Ord,
T: FromValue,
{
let value = match self.inner.get(k) {
Some(value) => value.clone(),
None => return VmResult::Ok(None),
};
VmResult::Ok(Some(vm_try!(T::from_value(value))))
}
/// Returns a mutable reference to the value corresponding to the key.
#[inline]
pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut Value>
where
String: borrow::Borrow<Q>,
Q: ?Sized + hash::Hash + cmp::Eq + cmp::Ord,
{
self.inner.get_mut(k)
}
/// Returns `true` if the map contains a value for the specified key.
#[inline]
pub fn contains_key<Q>(&self, k: &Q) -> bool
where
String: borrow::Borrow<Q>,
Q: ?Sized + hash::Hash + cmp::Eq + cmp::Ord,
{
self.inner.contains_key(k)
}
/// Removes a key from the map, returning the value at the key if the key
/// was previously in the map.
#[inline]
pub fn remove<Q>(&mut self, k: &Q) -> Option<Value>
where
String: borrow::Borrow<Q>,
Q: ?Sized + hash::Hash + cmp::Eq + cmp::Ord,
{
self.inner.remove(k)
}
/// Inserts a key-value pair into the dynamic object, converting it as
/// necessary through the [`ToValue`] trait.
#[inline]
pub fn insert_value<T>(&mut self, k: String, v: T) -> VmResult<()>
where
T: ToValue,
{
vm_try!(self.inner.try_insert(k, vm_try!(v.to_value())));
VmResult::Ok(())
}
/// Inserts a key-value pair into the map.
///
/// If the map did not have this key present, `None` is returned.
///
/// # Examples
///
/// ```rune
/// let map = #{};
/// assert_eq!(map.insert("a", 1), None);
/// assert_eq!(map.is_empty(), false);
///
/// map.insert("b", 2);
/// assert_eq!(map.insert("b", 3), Some(2));
/// assert_eq!(map["b"], 3);
/// ```
#[inline]
#[rune::function(path = Self::insert)]
pub(crate) fn rune_insert(&mut self, k: String, v: Value) -> VmResult<Option<Value>> {
VmResult::Ok(vm_try!(self.inner.try_insert(k, v)))
}
/// Inserts a key-value pair into the map.
///
/// If the map did not have this key present, `None` is returned.
#[inline]
pub fn insert(&mut self, k: String, v: Value) -> alloc::Result<Option<Value>> {
self.inner.try_insert(k, v)
}
/// Clears the object, removing all key-value pairs. Keeps the allocated
/// memory for reuse.
#[inline]
#[rune::function(keep)]
pub fn clear(&mut self) {
self.inner.clear();
}
/// An iterator visiting all key-value pairs in arbitrary order.
/// The iterator element type is `(&'a String, &'a Value)`.
pub fn iter(&self) -> Iter<'_> {
self.inner.iter()
}
/// An iterator visiting all keys in arbitrary order.
/// The iterator element type is `&'a String`.
pub fn keys(&self) -> Keys<'_> {
self.inner.keys()
}
/// An iterator visiting all values in arbitrary order.
/// The iterator element type is `&'a Value`.
pub fn values(&self) -> Values<'_> {
self.inner.values()
}
/// An iterator visiting all key-value pairs in arbitrary order,
/// with mutable references to the values.
///
/// The iterator element type is `(&'a String, &'a mut Value)`.
pub fn iter_mut(&mut self) -> IterMut<'_> {
self.inner.iter_mut()
}
/// An iterator visiting all keys and values in arbitrary order.
///
/// # Examples
///
/// ```rune
/// let object = #{a: 1, b: 2, c: 3};
/// let vec = [];
///
/// for key in object.iter() {
/// vec.push(key);
/// }
///
/// vec.sort_by(|a, b| a.0.cmp(b.0));
/// assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
/// ```
#[rune::function(keep, path = Self::iter)]
pub fn rune_iter(this: Ref<Self>) -> RuneIter {
// SAFETY: we're holding onto the related reference guard, and making
// sure that it's dropped after the iterator.
let iter = unsafe { this.inner.raw_table().iter() };
let (_, guard) = Ref::into_raw(this);
RuneIter { iter, guard }
}
/// An iterator visiting all keys in arbitrary order.
///
/// # Examples
///
/// ```rune
/// let object = #{a: 1, b: 2, c: 3};
/// let vec = [];
///
/// for key in object.keys() {
/// vec.push(key);
/// }
///
/// vec.sort_by(|a, b| a.cmp(b));
/// assert_eq!(vec, ["a", "b", "c"]);
/// ```
#[rune::function(keep, path = Self::keys)]
pub fn rune_keys(this: Ref<Self>) -> RuneIterKeys {
// SAFETY: we're holding onto the related reference guard, and making
// sure that it's dropped after the iterator.
let iter = unsafe { this.inner.raw_table().iter() };
let (_, guard) = Ref::into_raw(this);
RuneIterKeys { iter, guard }
}
/// An iterator visiting all values in arbitrary order.
///
/// # Examples
///
/// ```rune
/// let object = #{a: 1, b: 2, c: 3};
/// let vec = [];
///
/// for key in object.values() {
/// vec.push(key);
/// }
///
/// vec.sort_by(|a, b| a.cmp(b));
/// assert_eq!(vec, [1, 2, 3]);
/// ```
#[rune::function(keep, path = Self::values)]
pub fn rune_values(this: Ref<Self>) -> RuneValues {
// SAFETY: we're holding onto the related reference guard, and making
// sure that it's dropped after the iterator.
let iter = unsafe { this.inner.raw_table().iter() };
let (_, guard) = Ref::into_raw(this);
RuneValues { iter, guard }
}
pub(crate) fn partial_eq_with(
a: &Self,
b: &Self,
caller: &mut dyn ProtocolCaller,
) -> VmResult<bool> {
if a.len() != b.len() {
return VmResult::Ok(false);
}
for (k1, v1) in a.iter() {
let Some(v2) = b.get(k1) else {
return VmResult::Ok(false);
};
if !vm_try!(Value::partial_eq_with(v1, v2, caller)) {
return VmResult::Ok(false);
}
}
VmResult::Ok(true)
}
pub(crate) fn eq_with(
a: &Self,
b: &Self,
eq: fn(&Value, &Value, &mut dyn ProtocolCaller) -> VmResult<bool>,
caller: &mut dyn ProtocolCaller,
) -> VmResult<bool> {
if a.inner.len() != b.inner.len() {
return VmResult::Ok(false);
}
for (key, a) in a.inner.iter() {
let Some(b) = b.inner.get(key) else {
return VmResult::Ok(false);
};
if !vm_try!(eq(a, b, caller)) {
return VmResult::Ok(false);
}
}
VmResult::Ok(true)
}
}
impl TryClone for Object {
fn try_clone(&self) -> alloc::Result<Self> {
Ok(Self {
inner: self.inner.try_clone()?,
})
}
}
impl<'a> IntoIterator for &'a Object {
type Item = (&'a String, &'a Value);
type IntoIter = Iter<'a>;
fn into_iter(self) -> Self::IntoIter {
self.iter()
}
}
impl<'a> IntoIterator for &'a mut Object {
type Item = (&'a String, &'a mut Value);
type IntoIter = IterMut<'a>;
fn into_iter(self) -> Self::IntoIter {
self.iter_mut()
}
}
impl IntoIterator for Object {
type Item = (String, Value);
type IntoIter = IntoIter;
/// Creates a consuming iterator, that is, one that moves each key-value
/// pair out of the object in arbitrary order. The object cannot be used
/// after calling this.
fn into_iter(self) -> Self::IntoIter {
self.inner.into_iter()
}
}
impl fmt::Debug for Object {
#[inline]
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_map().entries(self.inner.iter()).finish()
}
}
#[derive(Any)]
#[rune(item = ::std::object, name = Iter)]
pub struct RuneIter {
iter: RawIter<(String, Value)>,
#[allow(unused)]
guard: RawAnyGuard,
}
impl RuneIter {
#[rune::function(instance, keep, protocol = NEXT)]
pub fn next(&mut self) -> VmResult<Option<(String, Value)>> {
unsafe {
let Some(bucket) = self.iter.next() else {
return VmResult::Ok(None);
};
let (key, value) = bucket.as_ref();
let key = vm_try!(key.try_clone());
VmResult::Ok(Some((key, value.clone())))
}
}
#[rune::function(instance, keep, protocol = SIZE_HINT)]
pub fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
#[rune::function(instance, keep, protocol = LEN)]
pub fn len(&self) -> usize {
self.iter.len()
}
}
impl iter::Iterator for RuneIter {
type Item = Result<(String, Value), VmError>;
#[inline]
fn next(&mut self) -> Option<Self::Item> {
match RuneIter::next(self) {
VmResult::Ok(Some(value)) => Some(Ok(value)),
VmResult::Ok(None) => None,
VmResult::Err(err) => Some(Err(err)),
}
}
}
#[derive(Any)]
#[rune(item = ::std::object, name = Keys)]
pub struct RuneIterKeys {
iter: RawIter<(String, Value)>,
#[allow(unused)]
guard: RawAnyGuard,
}
impl RuneIterKeys {
#[rune::function(instance, keep, protocol = NEXT)]
pub fn next(&mut self) -> VmResult<Option<String>> {
unsafe {
let Some(bucket) = self.iter.next() else {
return VmResult::Ok(None);
};
let (key, _) = bucket.as_ref();
let key = vm_try!(key.try_clone());
VmResult::Ok(Some(key))
}
}
#[rune::function(instance, keep, protocol = SIZE_HINT)]
pub fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
#[rune::function(instance, keep, protocol = LEN)]
pub fn len(&self) -> usize {
self.iter.len()
}
}
impl iter::Iterator for RuneIterKeys {
type Item = Result<String, VmError>;
#[inline]
fn next(&mut self) -> Option<Self::Item> {
match RuneIterKeys::next(self) {
VmResult::Ok(Some(value)) => Some(Ok(value)),
VmResult::Ok(None) => None,
VmResult::Err(err) => Some(Err(err)),
}
}
}
#[derive(Any)]
#[rune(item = ::std::object, name = Values)]
pub struct RuneValues {
iter: RawIter<(String, Value)>,
#[allow(unused)]
guard: RawAnyGuard,
}
impl RuneValues {
#[rune::function(instance, keep, protocol = NEXT)]
pub fn next(&mut self) -> VmResult<Option<Value>> {
unsafe {
let Some(bucket) = self.iter.next() else {
return VmResult::Ok(None);
};
let (_, value) = bucket.as_ref();
VmResult::Ok(Some(value.clone()))
}
}
#[rune::function(instance, keep, protocol = SIZE_HINT)]
pub fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
#[rune::function(instance, keep, protocol = LEN)]
pub fn len(&self) -> usize {
self.iter.len()
}
}
impl iter::Iterator for RuneValues {
type Item = Result<Value, VmError>;
#[inline]
fn next(&mut self) -> Option<Self::Item> {
match RuneValues::next(self) {
VmResult::Ok(Some(value)) => Some(Ok(value)),
VmResult::Ok(None) => None,
VmResult::Err(err) => Some(Err(err)),
}
}
}