Make Vertex immutable

To match the C++ implementation. I meant to do this at the same time as the other metadata structs but missed it.
This commit is contained in:
Oliver Hamlet
2025-05-14 18:24:54 +01:00
parent beab02c3fe
commit 517dc6b43c
6 changed files with 60 additions and 78 deletions
+36 -34
View File
@@ -2,6 +2,41 @@
#include "api/exception/exception.h"
namespace {
std::optional<loot::EdgeType> convert(loot::rust::EdgeType edgeType) {
switch (edgeType) {
case loot::rust::EdgeType::Hardcoded:
return loot::EdgeType::hardcoded;
case loot::rust::EdgeType::MasterFlag:
return loot::EdgeType::masterFlag;
case loot::rust::EdgeType::Master:
return loot::EdgeType::master;
case loot::rust::EdgeType::MasterlistRequirement:
return loot::EdgeType::masterlistRequirement;
case loot::rust::EdgeType::UserRequirement:
return loot::EdgeType::userRequirement;
case loot::rust::EdgeType::MasterlistLoadAfter:
return loot::EdgeType::masterlistLoadAfter;
case loot::rust::EdgeType::UserLoadAfter:
return loot::EdgeType::userLoadAfter;
case loot::rust::EdgeType::MasterlistGroup:
return loot::EdgeType::masterlistGroup;
case loot::rust::EdgeType::UserGroup:
return loot::EdgeType::userGroup;
case loot::rust::EdgeType::RecordOverlap:
return loot::EdgeType::recordOverlap;
case loot::rust::EdgeType::AssetOverlap:
return loot::EdgeType::assetOverlap;
case loot::rust::EdgeType::TieBreak:
return loot::EdgeType::tieBreak;
case loot::rust::EdgeType::BlueprintMaster:
return loot::EdgeType::blueprintMaster;
default:
return std::nullopt;
}
}
}
namespace loot {
// To public types
/////////////////////
@@ -93,42 +128,9 @@ loot::PluginMetadata convert(const loot::rust::PluginMetadata& metadata) {
return output;
}
std::optional<loot::EdgeType> convert(uint8_t edgeType) {
switch (edgeType) {
case static_cast<uint8_t>(loot::rust::EdgeType::Hardcoded):
return loot::EdgeType::hardcoded;
case static_cast<uint8_t>(loot::rust::EdgeType::MasterFlag):
return loot::EdgeType::masterFlag;
case static_cast<uint8_t>(loot::rust::EdgeType::Master):
return loot::EdgeType::master;
case static_cast<uint8_t>(loot::rust::EdgeType::MasterlistRequirement):
return loot::EdgeType::masterlistRequirement;
case static_cast<uint8_t>(loot::rust::EdgeType::UserRequirement):
return loot::EdgeType::userRequirement;
case static_cast<uint8_t>(loot::rust::EdgeType::MasterlistLoadAfter):
return loot::EdgeType::masterlistLoadAfter;
case static_cast<uint8_t>(loot::rust::EdgeType::UserLoadAfter):
return loot::EdgeType::userLoadAfter;
case static_cast<uint8_t>(loot::rust::EdgeType::MasterlistGroup):
return loot::EdgeType::masterlistGroup;
case static_cast<uint8_t>(loot::rust::EdgeType::UserGroup):
return loot::EdgeType::userGroup;
case static_cast<uint8_t>(loot::rust::EdgeType::RecordOverlap):
return loot::EdgeType::recordOverlap;
case static_cast<uint8_t>(loot::rust::EdgeType::AssetOverlap):
return loot::EdgeType::assetOverlap;
case static_cast<uint8_t>(loot::rust::EdgeType::TieBreak):
return loot::EdgeType::tieBreak;
case static_cast<uint8_t>(loot::rust::EdgeType::BlueprintMaster):
return loot::EdgeType::blueprintMaster;
default:
return std::nullopt;
}
}
loot::Vertex convert(const loot::rust::Vertex& vertex) {
try {
const auto outEdgeType = convert(vertex.out_edge_type());
const auto outEdgeType = ::convert(vertex.out_edge_type());
if (outEdgeType.has_value()) {
return loot::Vertex(convert(vertex.name()), outEdgeType.value());
} else {
+11 -10
View File
@@ -220,24 +220,25 @@ impl Database {
#[repr(transparent)]
pub struct Vertex(libloot::Vertex);
pub fn new_vertex(name: String) -> Box<Vertex> {
Box::new(Vertex(libloot::Vertex::new(name)))
pub fn new_vertex(name: String, out_edge_type: EdgeType) -> Result<Box<Vertex>, VerboseError> {
let mut vertex = libloot::Vertex::new(name);
if out_edge_type != EdgeType::None {
vertex = vertex.with_out_edge_type(out_edge_type.try_into()?);
}
Ok(Box::new(Vertex(vertex)))
}
impl Vertex {
// A value of 255 is used to indicate that there is no out edge.
pub fn out_edge_type(&self) -> Result<u8, VerboseError> {
pub fn out_edge_type(&self) -> Result<EdgeType, VerboseError> {
match self.0.out_edge_type() {
Some(e) => Ok(EdgeType::try_from(e)?.repr),
None => Ok(u8::MAX),
Some(e) => EdgeType::try_from(e).map_err(Into::into),
None => Ok(EdgeType::None),
}
}
pub fn set_out_edge_type(&mut self, out_edge_type: EdgeType) -> Result<(), VerboseError> {
self.0.set_out_edge_type(out_edge_type.try_into()?);
Ok(())
}
pub fn boxed_clone(&self) -> Box<Self> {
Box::new(Self(self.0.clone()))
}
+3 -4
View File
@@ -238,6 +238,7 @@ mod ffi {
}
pub enum EdgeType {
None,
Hardcoded,
MasterFlag,
Master,
@@ -512,13 +513,11 @@ mod ffi {
extern "Rust" {
type Vertex;
pub fn new_vertex(name: String) -> Box<Vertex>;
pub fn new_vertex(name: String, out_edge_type: EdgeType) -> Result<Box<Vertex>>;
pub fn name(&self) -> &str;
pub fn out_edge_type(&self) -> Result<u8>;
pub fn set_out_edge_type(&mut self, #[into] out_edge_type: EdgeType) -> Result<()>;
pub fn out_edge_type(&self) -> Result<EdgeType>;
pub fn boxed_clone(&self) -> Box<Vertex>;
}
+8 -8
View File
@@ -241,8 +241,14 @@ pub struct Vertex(libloot::Vertex);
#[napi]
impl Vertex {
#[napi(constructor)]
pub fn new(name: String) -> Self {
Self(libloot::Vertex::new(name))
pub fn new(name: String, out_edge_type: Option<EdgeType>) -> Self {
let mut vertex = libloot::Vertex::new(name);
if let Some(out_edge_type) = out_edge_type {
vertex = vertex.with_out_edge_type(out_edge_type.into());
}
Self(vertex)
}
#[napi(getter)]
@@ -257,12 +263,6 @@ impl Vertex {
.map(|e| e.try_into().map_err(Into::into))
.transpose()
}
#[napi(setter)]
pub fn set_out_edge_type(&mut self, out_edge_type: EdgeType) {
let out_edge_type = out_edge_type.into();
self.0.set_out_edge_type(out_edge_type);
}
}
impl From<libloot::Vertex> for Vertex {
+1 -15
View File
@@ -1,5 +1,4 @@
use std::{
hash::{DefaultHasher, Hash, Hasher},
path::PathBuf,
sync::{Arc, RwLock},
};
@@ -225,7 +224,7 @@ impl From<Arc<RwLock<libloot::Database>>> for Database {
}
}
#[pyclass(eq, ord, str = "{0:?}")]
#[pyclass(eq, ord, frozen, hash, str = "{0:?}")]
#[derive(Clone, Debug, Default, Eq, PartialEq, Ord, PartialOrd, Hash)]
#[repr(transparent)]
pub struct Vertex(libloot::Vertex);
@@ -250,13 +249,6 @@ impl Vertex {
.transpose()
}
#[setter]
fn set_out_edge_type(&mut self, out_edge_type: EdgeType) -> Result<(), VerboseError> {
let out_edge_type = out_edge_type.try_into()?;
self.0.set_out_edge_type(out_edge_type);
Ok(())
}
fn __repr__(slf: &Bound<'_, Self>) -> PyResult<String> {
let class_name = slf.get_type().qualname()?;
let inner = &slf.borrow().0;
@@ -267,12 +259,6 @@ impl Vertex {
inner.out_edge_type().map_or(NONE_REPR, repr_edge_type),
))
}
fn __hash__(&self) -> u64 {
let mut hasher = DefaultHasher::new();
self.0.hash(&mut hasher);
hasher.finish()
}
}
impl From<libloot::Vertex> for Vertex {
+1 -7
View File
@@ -59,7 +59,7 @@ impl Vertex {
/// Set the type of the edge going from this vertex to the next in the path.
#[must_use]
pub fn with_out_edge_type(mut self, out_edge_type: EdgeType) -> Self {
self.set_out_edge_type(out_edge_type);
self.out_edge_type = Some(out_edge_type);
self
}
@@ -72,10 +72,4 @@ impl Vertex {
pub fn out_edge_type(&self) -> Option<EdgeType> {
self.out_edge_type
}
/// Set the type of the edge going from this vertex to the next in the path.
pub fn set_out_edge_type(&mut self, out_edge_type: EdgeType) -> &mut Self {
self.out_edge_type = Some(out_edge_type);
self
}
}