Skip to content

Refactor TraceState for fewer allocations #238

New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

Merged
merged 2 commits into from
Oct 2, 2020
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
48 changes: 31 additions & 17 deletions src/api/trace/span_context.rs
Original file line number Diff line number Diff line change
Expand Up @@ -126,7 +126,7 @@ impl SpanId {
/// [W3C specification]: https://www.w3.org/TR/trace-context/#tracestate-header
#[cfg_attr(feature = "serialize", derive(Deserialize, Serialize))]
#[derive(Clone, Debug, Default, Eq, PartialEq)]
pub struct TraceState(VecDeque<(String, String)>);
pub struct TraceState(Option<VecDeque<(String, String)>>);

impl TraceState {
/// Validates that the given `TraceState` list-member key is valid per the [W3 Spec]['spec'].
Expand Down Expand Up @@ -170,7 +170,7 @@ impl TraceState {
K: ToString,
V: ToString,
{
let ordered_data: Result<VecDeque<(String, String)>, ()> = trace_state
let ordered_data = trace_state
.into_iter()
.map(|(key, value)| {
let (key, value) = (key.to_string(), value.to_string());
Expand All @@ -181,19 +181,25 @@ impl TraceState {

Ok((key, value))
})
.collect();
.collect::<Result<VecDeque<_>, ()>>()?;

ordered_data.map(TraceState)
if ordered_data.is_empty() {
Ok(TraceState(None))
} else {
Ok(TraceState(Some(ordered_data)))
}
}

/// Retrieves a value for a given key from the `TraceState` if it exists.
pub fn get(&self, key: &str) -> Option<&str> {
self.0.iter().find_map(|item| {
if item.0.as_str() == key {
Some(item.1.as_str())
} else {
None
}
self.0.as_ref().and_then(|kvs| {
kvs.iter().find_map(|item| {
if item.0.as_str() == key {
Some(item.1.as_str())
} else {
None
}
})
})
}

Expand All @@ -209,8 +215,9 @@ impl TraceState {
}

let mut trace_state = self.delete(key.clone())?;
let kvs = trace_state.0.get_or_insert(VecDeque::with_capacity(1));

trace_state.0.push_front((key, value));
kvs.push_front((key, value));

Ok(trace_state)
}
Expand All @@ -226,9 +233,12 @@ impl TraceState {
}

let mut owned = self.clone();
let kvs = owned.0.as_mut().ok_or(())?;

if let Some(index) = owned.0.iter().position(|x| *x.0 == *key) {
owned.0.remove(index);
if let Some(index) = kvs.iter().position(|x| *x.0 == *key) {
kvs.remove(index);
} else {
return Err(());
}

Ok(owned)
Expand All @@ -243,10 +253,14 @@ impl TraceState {
/// Creates a new `TraceState` header string, with the given key/value delimiter and entry delimiter.
pub fn header_delimited(&self, entry_delimiter: &str, list_delimiter: &str) -> String {
self.0
.iter()
.map(|(key, value)| format!("{}{}{}", key, entry_delimiter, value))
.collect::<Vec<String>>()
.join(list_delimiter)
.as_ref()
.map(|kvs| {
kvs.iter()
.map(|(key, value)| format!("{}{}{}", key, entry_delimiter, value))
.collect::<Vec<String>>()
.join(list_delimiter)
})
.unwrap_or_default()
}
}

Expand Down