/// `take` implementation for dictionary arrays
///
/// applies `take` to the keys of the dictionary array and returns a new dictionary array
/// with the same dictionary values and reordered keys
`take` implementation for dictionary arrays
applies `take` to the keys of the dictionary array and returns a new dictionary array
with the same dictionary values and reordered keys
` take ` implementation for dictionary arrays applies ` take ` to the keys of the dictionary array and returns a new dictionary array with the same dictionary values and reordered keys
pub fn take<K, I>(values: &DictionaryArray<K>, indices: &PrimitiveArray<I>) -> DictionaryArray<K>
where
    K: DictionaryKey,
    I: Index,
{
    let keys = take_primitive::<K, I>(values.keys(), indices);
    DictionaryArray::<K>::from_data(keys, values.values().clone())
}
pub fn take < K , I > ( values : & DictionaryArray < K > , indices : & PrimitiveArray < I > ) -> DictionaryArray < K > where K : DictionaryKey , I : Index , { let keys = take_primitive :: < K , I > ( values . keys ( ) , indices ) ; DictionaryArray :: < K > :: from_data ( keys , values . values ( ) . clone ( ) ) }
`take` implementation for dictionary arrays
applies `take` to the keys of the dictionary array and returns a new dictionary array
with the same dictionary values and reordered keys
` take ` implementation for dictionary arrays applies ` take ` to the keys of the dictionary array and returns a new dictionary array with the same dictionary values and reordered keys
values
&DictionaryArray<K>
indices
&PrimitiveArray<I>