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
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
use crate::utils::{parse_identifiers_normalized, quote_identifier};
use std::sync::Arc;
/// A fully resolved path to a table of the form "catalog.schema.table"
#[derive(Debug, Clone)]
pub struct ResolvedTableReference {
/// The catalog (aka database) containing the table
pub catalog: Arc<str>,
/// The schema containing the table
pub schema: Arc<str>,
/// The table name
pub table: Arc<str>,
}
impl std::fmt::Display for ResolvedTableReference {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "{}.{}.{}", self.catalog, self.schema, self.table)
}
}
/// A multi part identifier (path) to a table that may require further
/// resolution (e.g. `foo.bar`).
///
/// [`TableReference`]s are cheap to `clone()` as they are implemented with
/// `Arc`.
///
/// See [`ResolvedTableReference`] for a fully resolved table reference.
///
/// # Creating [`TableReference`]
///
/// When converting strings to [`TableReference`]s, the string is parsed as
/// though it were a SQL identifier, normalizing (convert to lowercase) any
/// unquoted identifiers. [`TableReference::bare`] creates references without
/// applying normalization semantics.
///
/// # Examples
/// ```
/// # use datafusion_common::TableReference;
/// // Get a table reference to 'mytable'
/// let table_reference = TableReference::from("mytable");
/// assert_eq!(table_reference, TableReference::bare("mytable"));
///
/// // Get a table reference to 'mytable' (note the capitalization)
/// let table_reference = TableReference::from("MyTable");
/// assert_eq!(table_reference, TableReference::bare("mytable"));
///
/// // Get a table reference to 'MyTable' (note the capitalization) using double quotes
/// // (programmatically it is better to use `TableReference::bare` for this)
/// let table_reference = TableReference::from(r#""MyTable""#);
/// assert_eq!(table_reference, TableReference::bare("MyTable"));
///
/// // Get a table reference to 'myschema.mytable' (note the capitalization)
/// let table_reference = TableReference::from("MySchema.MyTable");
/// assert_eq!(table_reference, TableReference::partial("myschema", "mytable"));
///```
#[derive(Debug, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]
pub enum TableReference {
/// An unqualified table reference, e.g. "table"
Bare {
/// The table name
table: Arc<str>,
},
/// A partially resolved table reference, e.g. "schema.table"
Partial {
/// The schema containing the table
schema: Arc<str>,
/// The table name
table: Arc<str>,
},
/// A fully resolved table reference, e.g. "catalog.schema.table"
Full {
/// The catalog (aka database) containing the table
catalog: Arc<str>,
/// The schema containing the table
schema: Arc<str>,
/// The table name
table: Arc<str>,
},
}
impl std::fmt::Display for TableReference {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
match self {
TableReference::Bare { table } => write!(f, "{table}"),
TableReference::Partial { schema, table } => {
write!(f, "{schema}.{table}")
}
TableReference::Full {
catalog,
schema,
table,
} => write!(f, "{catalog}.{schema}.{table}"),
}
}
}
impl TableReference {
/// Convenience method for creating a typed none `None`
pub fn none() -> Option<TableReference> {
None
}
/// Convenience method for creating a [`TableReference::Bare`]
///
/// As described on [`TableReference`] this does *NO* normalization at
/// all, so "Foo.Bar" stays as a reference to the table named
/// "Foo.Bar" (rather than "foo"."bar")
pub fn bare(table: impl Into<Arc<str>>) -> TableReference {
TableReference::Bare {
table: table.into(),
}
}
/// Convenience method for creating a [`TableReference::Partial`].
///
/// Note: *NO* normalization is applied to the schema or table name.
pub fn partial(
schema: impl Into<Arc<str>>,
table: impl Into<Arc<str>>,
) -> TableReference {
TableReference::Partial {
schema: schema.into(),
table: table.into(),
}
}
/// Convenience method for creating a [`TableReference::Full`]
///
/// Note: *NO* normalization is applied to the catalog, schema or table
/// name.
pub fn full(
catalog: impl Into<Arc<str>>,
schema: impl Into<Arc<str>>,
table: impl Into<Arc<str>>,
) -> TableReference {
TableReference::Full {
catalog: catalog.into(),
schema: schema.into(),
table: table.into(),
}
}
/// Retrieve the table name, regardless of qualification.
pub fn table(&self) -> &str {
match self {
Self::Full { table, .. }
| Self::Partial { table, .. }
| Self::Bare { table } => table,
}
}
/// Retrieve the schema name if [`Self::Partial]` or [`Self::`Full`],
/// `None` otherwise.
pub fn schema(&self) -> Option<&str> {
match self {
Self::Full { schema, .. } | Self::Partial { schema, .. } => Some(schema),
_ => None,
}
}
/// Retrieve the catalog name if [`Self::Full`], `None` otherwise.
pub fn catalog(&self) -> Option<&str> {
match self {
Self::Full { catalog, .. } => Some(catalog),
_ => None,
}
}
/// Compare with another [`TableReference`] as if both are resolved.
/// This allows comparing across variants. If a field is not present
/// in both variants being compared then it is ignored in the comparison.
///
/// e.g. this allows a [`TableReference::Bare`] to be considered equal to a
/// fully qualified [`TableReference::Full`] if the table names match.
pub fn resolved_eq(&self, other: &Self) -> bool {
match self {
TableReference::Bare { table } => **table == *other.table(),
TableReference::Partial { schema, table } => {
**table == *other.table()
&& other.schema().map_or(true, |s| *s == **schema)
}
TableReference::Full {
catalog,
schema,
table,
} => {
**table == *other.table()
&& other.schema().map_or(true, |s| *s == **schema)
&& other.catalog().map_or(true, |c| *c == **catalog)
}
}
}
/// Given a default catalog and schema, ensure this table reference is fully
/// resolved
pub fn resolve(
self,
default_catalog: &str,
default_schema: &str,
) -> ResolvedTableReference {
match self {
Self::Full {
catalog,
schema,
table,
} => ResolvedTableReference {
catalog,
schema,
table,
},
Self::Partial { schema, table } => ResolvedTableReference {
catalog: default_catalog.into(),
schema,
table,
},
Self::Bare { table } => ResolvedTableReference {
catalog: default_catalog.into(),
schema: default_schema.into(),
table,
},
}
}
/// Forms a string where the identifiers are quoted
///
/// # Example
/// ```
/// # use datafusion_common::TableReference;
/// let table_reference = TableReference::partial("myschema", "mytable");
/// assert_eq!(table_reference.to_quoted_string(), "myschema.mytable");
///
/// let table_reference = TableReference::partial("MySchema", "MyTable");
/// assert_eq!(table_reference.to_quoted_string(), r#""MySchema"."MyTable""#);
/// ```
pub fn to_quoted_string(&self) -> String {
match self {
TableReference::Bare { table } => quote_identifier(table).to_string(),
TableReference::Partial { schema, table } => {
format!("{}.{}", quote_identifier(schema), quote_identifier(table))
}
TableReference::Full {
catalog,
schema,
table,
} => format!(
"{}.{}.{}",
quote_identifier(catalog),
quote_identifier(schema),
quote_identifier(table)
),
}
}
/// Forms a [`TableReference`] by parsing `s` as a multipart SQL
/// identifier. See docs on [`TableReference`] for more details.
pub fn parse_str(s: &str) -> Self {
let mut parts = parse_identifiers_normalized(s, false);
match parts.len() {
1 => Self::Bare {
table: parts.remove(0).into(),
},
2 => Self::Partial {
schema: parts.remove(0).into(),
table: parts.remove(0).into(),
},
3 => Self::Full {
catalog: parts.remove(0).into(),
schema: parts.remove(0).into(),
table: parts.remove(0).into(),
},
_ => Self::Bare { table: s.into() },
}
}
/// Decompose a [`TableReference`] to separate parts. The result vector contains
/// at most three elements in the following sequence:
/// ```no_rust
/// [<catalog>, <schema>, table]
/// ```
pub fn to_vec(&self) -> Vec<String> {
match self {
TableReference::Bare { table } => vec![table.to_string()],
TableReference::Partial { schema, table } => {
vec![schema.to_string(), table.to_string()]
}
TableReference::Full {
catalog,
schema,
table,
} => vec![catalog.to_string(), schema.to_string(), table.to_string()],
}
}
}
/// Parse a string into a TableReference, normalizing where appropriate
///
/// See full details on [`TableReference::parse_str`]
impl<'a> From<&'a str> for TableReference {
fn from(s: &'a str) -> Self {
Self::parse_str(s)
}
}
impl<'a> From<&'a String> for TableReference {
fn from(s: &'a String) -> Self {
Self::parse_str(s)
}
}
impl From<String> for TableReference {
fn from(s: String) -> Self {
Self::parse_str(&s)
}
}
impl From<ResolvedTableReference> for TableReference {
fn from(resolved: ResolvedTableReference) -> Self {
Self::Full {
catalog: resolved.catalog,
schema: resolved.schema,
table: resolved.table,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_table_reference_from_str_normalizes() {
let expected = TableReference::Full {
catalog: "catalog".into(),
schema: "FOO\".bar".into(),
table: "table".into(),
};
let actual = TableReference::from("catalog.\"FOO\"\".bar\".TABLE");
assert_eq!(expected, actual);
let expected = TableReference::Partial {
schema: "FOO\".bar".into(),
table: "table".into(),
};
let actual = TableReference::from("\"FOO\"\".bar\".TABLE");
assert_eq!(expected, actual);
let expected = TableReference::Bare {
table: "table".into(),
};
let actual = TableReference::from("TABLE");
assert_eq!(expected, actual);
// if fail to parse, take entire input string as identifier
let expected = TableReference::Bare {
table: "TABLE()".into(),
};
let actual = TableReference::from("TABLE()");
assert_eq!(expected, actual);
}
#[test]
fn test_table_reference_to_vector() {
let table_reference = TableReference::parse_str("table");
assert_eq!(vec!["table".to_string()], table_reference.to_vec());
let table_reference = TableReference::parse_str("schema.table");
assert_eq!(
vec!["schema".to_string(), "table".to_string()],
table_reference.to_vec()
);
let table_reference = TableReference::parse_str("catalog.schema.table");
assert_eq!(
vec![
"catalog".to_string(),
"schema".to_string(),
"table".to_string()
],
table_reference.to_vec()
);
}
}