forked from pola-rs/polars
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
fix(rust, python): dedicated
rename implementation. (pola-rs#6688)
- Loading branch information
Showing
18 changed files
with
507 additions
and
174 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
41 changes: 41 additions & 0 deletions
41
polars/polars-lazy/polars-plan/src/logical_plan/functions/rename.rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,41 @@ | ||
| use super::*; | ||
|
|
||
| pub(super) fn rename_impl( | ||
| mut df: DataFrame, | ||
| existing: &[String], | ||
| new: &[String], | ||
| ) -> PolarsResult<DataFrame> { | ||
| let positions = existing | ||
| .iter() | ||
| .map(|old| df.find_idx_by_name(old)) | ||
| .collect::<Vec<_>>(); | ||
|
|
||
| for (pos, name) in positions.iter().zip(new.iter()) { | ||
| // the column might be removed due to projection pushdown | ||
| // so we only update if we can find it. | ||
| if let Some(pos) = pos { | ||
| df.get_columns_mut()[*pos].rename(name); | ||
| } | ||
| } | ||
| // recreate dataframe so we check duplicates | ||
| let columns = std::mem::take(df.get_columns_mut()); | ||
| DataFrame::new(columns) | ||
| } | ||
|
|
||
| pub(super) fn rename_schema<'a>( | ||
| input_schema: &'a SchemaRef, | ||
| existing: &[String], | ||
| new: &[String], | ||
| ) -> PolarsResult<Cow<'a, SchemaRef>> { | ||
| let mut new_schema = (**input_schema).clone(); | ||
| for (old, new) in existing.iter().zip(new.iter()) { | ||
| // the column might be removed due to projection pushdown | ||
| // so we only update if we can find it. | ||
| if let Some(dtype) = input_schema.get(old) { | ||
| if new_schema.with_column(new.clone(), dtype.clone()).is_none() { | ||
| new_schema.remove(old); | ||
| } | ||
| } | ||
| } | ||
| Ok(Cow::Owned(Arc::new(new_schema))) | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
40 changes: 40 additions & 0 deletions
40
polars/polars-lazy/polars-plan/src/logical_plan/optimizer/predicate_pushdown/keys.rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,40 @@ | ||
| //! Keys in the `acc_predicates` hashmap. | ||
| use super::*; | ||
|
|
||
| // an invisible ascii token we use as delimiter | ||
| const HIDDEN_DELIMITER: char = '\u{1D17A}'; | ||
|
|
||
| /// Determine the hashmap key by combining all the leaf column names of a predicate | ||
| pub(super) fn predicate_to_key(predicate: Node, expr_arena: &Arena<AExpr>) -> Arc<str> { | ||
| let mut iter = aexpr_to_leaf_names_iter(predicate, expr_arena); | ||
| if let Some(first) = iter.next() { | ||
| if let Some(second) = iter.next() { | ||
| let mut new = String::with_capacity(32 * iter.size_hint().0); | ||
| new.push_str(&first); | ||
| new.push(HIDDEN_DELIMITER); | ||
| new.push_str(&second); | ||
|
|
||
| for name in iter { | ||
| new.push(HIDDEN_DELIMITER); | ||
| new.push_str(&name); | ||
| } | ||
| return Arc::from(new); | ||
| } | ||
| first | ||
| } else { | ||
| let mut s = String::new(); | ||
| s.push(HIDDEN_DELIMITER); | ||
| Arc::from(s) | ||
| } | ||
| } | ||
|
|
||
| pub(super) fn key_has_name(key: &str, name: &str) -> bool { | ||
| if key.contains(HIDDEN_DELIMITER) { | ||
| for root_name in key.split(HIDDEN_DELIMITER) { | ||
| if root_name == name { | ||
| return true; | ||
| } | ||
| } | ||
| } | ||
| key == name | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.