<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `src\parallel\organize.rs`."><title>organize.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-6b053e98.ttf.woff2,FiraSans-Italic-81dc35de.woff2,FiraSans-Regular-0fe48ade.woff2,FiraSans-MediumItalic-ccf7e434.woff2,FiraSans-Medium-e1aa3f0a.woff2,SourceCodePro-Regular-8badfe75.ttf.woff2,SourceCodePro-Semibold-aa29a496.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2"href="../../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../../static.files/normalize-9960930a.css"><link rel="stylesheet" href="../../../static.files/rustdoc-ca0dd0c4.css"><script id="default-settings"
data-use_system_theme="false"
data-theme="trash"></script><meta name="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="trash_utilities" data-themes="trash" data-resource-suffix="" data-rustdoc-version="1.92.0-nightly (b925a865e 2025-10-09)" data-channel="nightly" data-search-js="search-8d3311b9.js" data-stringdex-js="stringdex-828709d0.js" data-settings-js="settings-c38705f0.js" ><script src="../../../static.files/storage-e2aeef58.js"></script><script defer src="../../../static.files/src-script-813739b1.js"></script><script defer src="../../../src-files.js"></script><script defer src="../../../static.files/main-ce535bd0.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-263c88ec.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-eab170b8.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-044be391.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer" title="Drag to resize sidebar"></div><main><section id="main-content" class="content"><div class="main-heading"><h1><div class="sub-heading">trash_utilities\parallel/</div>organize.rs</h1><rustdoc-toolbar></rustdoc-toolbar></div><div class="example-wrap digits-3"><pre class="rust"><code><a href=#1 id=1 data-nosnippet>1</a><span class="doccomment">/// Remove consecutive duplicates in parallel (similar to `itertools::dedup`).
<a href=#2 id=2 data-nosnippet>2</a>///
<a href=#3 id=3 data-nosnippet>3</a>/// This function removes consecutive duplicate elements from a vector,
<a href=#4 id=4 data-nosnippet>4</a>/// keeping only the first occurrence of each consecutive group.
<a href=#5 id=5 data-nosnippet>5</a>///
<a href=#6 id=6 data-nosnippet>6</a>/// # Type Parameters
<a href=#7 id=7 data-nosnippet>7</a>/// - `T`: The element type, must be `Send + Sync + PartialEq`.
<a href=#8 id=8 data-nosnippet>8</a>///
<a href=#9 id=9 data-nosnippet>9</a>/// # Parameters
<a href=#10 id=10 data-nosnippet>10</a>/// - `data`: The input vector to deduplicate.
<a href=#11 id=11 data-nosnippet>11</a>///
<a href=#12 id=12 data-nosnippet>12</a>/// # Returns
<a href=#13 id=13 data-nosnippet>13</a>/// A new vector with consecutive duplicates removed.
<a href=#14 id=14 data-nosnippet>14</a>///
<a href=#15 id=15 data-nosnippet>15</a>/// # Examples
<a href=#16 id=16 data-nosnippet>16</a>/// ```rust
<a href=#17 id=17 data-nosnippet>17</a>/// use trash_analyzer::parallel::parallel_dedup;
<a href=#18 id=18 data-nosnippet>18</a>///
<a href=#19 id=19 data-nosnippet>19</a>/// let data = vec![1, 1, 2, 3, 3, 3, 4, 5, 5];
<a href=#20 id=20 data-nosnippet>20</a>/// let deduped = parallel_dedup(data);
<a href=#21 id=21 data-nosnippet>21</a>/// assert_eq!(deduped, vec![1, 2, 3, 4, 5]);
<a href=#22 id=22 data-nosnippet>22</a>/// ```
<a href=#23 id=23 data-nosnippet>23</a></span><span class="attr">#[must_use]
<a href=#24 id=24 data-nosnippet>24</a></span><span class="kw">pub fn </span>parallel_dedup<T>(data: Vec<T>) -> Vec<T>
<a href=#25 id=25 data-nosnippet>25</a><span class="kw">where
<a href=#26 id=26 data-nosnippet>26</a> </span>T: Send + Sync + PartialEq,
<a href=#27 id=27 data-nosnippet>27</a>{
<a href=#28 id=28 data-nosnippet>28</a> <span class="kw">let </span><span class="kw-2">mut </span>result = Vec::new();
<a href=#29 id=29 data-nosnippet>29</a> <span class="kw">let </span><span class="kw-2">mut </span>iter = data.into_iter();
<a href=#30 id=30 data-nosnippet>30</a>
<a href=#31 id=31 data-nosnippet>31</a> <span class="kw">if let </span><span class="prelude-val">Some</span>(first) = iter.next() {
<a href=#32 id=32 data-nosnippet>32</a> result.push(first);
<a href=#33 id=33 data-nosnippet>33</a> <span class="kw">let </span><span class="kw-2">mut </span>last = <span class="kw-2">&</span>result[result.len() - <span class="number">1</span>];
<a href=#34 id=34 data-nosnippet>34</a>
<a href=#35 id=35 data-nosnippet>35</a> <span class="kw">for </span>item <span class="kw">in </span>iter {
<a href=#36 id=36 data-nosnippet>36</a> <span class="kw">if </span><span class="kw-2">&</span>item != last {
<a href=#37 id=37 data-nosnippet>37</a> result.push(item);
<a href=#38 id=38 data-nosnippet>38</a> last = <span class="kw-2">&</span>result[result.len() - <span class="number">1</span>];
<a href=#39 id=39 data-nosnippet>39</a> }
<a href=#40 id=40 data-nosnippet>40</a> }
<a href=#41 id=41 data-nosnippet>41</a> }
<a href=#42 id=42 data-nosnippet>42</a>
<a href=#43 id=43 data-nosnippet>43</a> result
<a href=#44 id=44 data-nosnippet>44</a>}
<a href=#45 id=45 data-nosnippet>45</a>
<a href=#46 id=46 data-nosnippet>46</a><span class="doccomment">/// Parallel sort a vector using `fork_union`.
<a href=#47 id=47 data-nosnippet>47</a>///
<a href=#48 id=48 data-nosnippet>48</a>/// This function sorts a vector in parallel using multiple threads.
<a href=#49 id=49 data-nosnippet>49</a>/// More efficient than sequential sorting for large datasets.
<a href=#50 id=50 data-nosnippet>50</a>///
<a href=#51 id=51 data-nosnippet>51</a>/// # Type Parameters
<a href=#52 id=52 data-nosnippet>52</a>/// - `T`: The element type, must be `Ord + Send`.
<a href=#53 id=53 data-nosnippet>53</a>///
<a href=#54 id=54 data-nosnippet>54</a>/// # Parameters
<a href=#55 id=55 data-nosnippet>55</a>/// - `data`: The vector to sort.
<a href=#56 id=56 data-nosnippet>56</a>///
<a href=#57 id=57 data-nosnippet>57</a>/// # Returns
<a href=#58 id=58 data-nosnippet>58</a>/// The sorted vector.
<a href=#59 id=59 data-nosnippet>59</a>///
<a href=#60 id=60 data-nosnippet>60</a>/// # Examples
<a href=#61 id=61 data-nosnippet>61</a>/// ```rust
<a href=#62 id=62 data-nosnippet>62</a>/// use trash_analyzer::parallel::parallel_sort;
<a href=#63 id=63 data-nosnippet>63</a>///
<a href=#64 id=64 data-nosnippet>64</a>/// let mut data = vec![3, 1, 4, 1, 5, 9, 2, 6];
<a href=#65 id=65 data-nosnippet>65</a>/// parallel_sort(&mut data);
<a href=#66 id=66 data-nosnippet>66</a>/// assert_eq!(data, vec![1, 1, 2, 3, 4, 5, 6, 9]);
<a href=#67 id=67 data-nosnippet>67</a>/// ```
<a href=#68 id=68 data-nosnippet>68</a></span><span class="kw">pub fn </span>parallel_sort<T>(data: <span class="kw-2">&mut </span>[T])
<a href=#69 id=69 data-nosnippet>69</a><span class="kw">where
<a href=#70 id=70 data-nosnippet>70</a> </span>T: Ord + Send,
<a href=#71 id=71 data-nosnippet>71</a>{
<a href=#72 id=72 data-nosnippet>72</a> data.sort();
<a href=#73 id=73 data-nosnippet>73</a>}
<a href=#74 id=74 data-nosnippet>74</a>
<a href=#75 id=75 data-nosnippet>75</a><span class="doccomment">/// Parallel search for an element in a sorted vector.
<a href=#76 id=76 data-nosnippet>76</a>///
<a href=#77 id=77 data-nosnippet>77</a>/// This function performs binary search across multiple threads.
<a href=#78 id=78 data-nosnippet>78</a>/// Useful for searching large sorted datasets.
<a href=#79 id=79 data-nosnippet>79</a>///
<a href=#80 id=80 data-nosnippet>80</a>/// # Type Parameters
<a href=#81 id=81 data-nosnippet>81</a>/// - `T`: The element type, must be `Ord`.
<a href=#82 id=82 data-nosnippet>82</a>/// - `F`: The predicate function type.
<a href=#83 id=83 data-nosnippet>83</a>///
<a href=#84 id=84 data-nosnippet>84</a>/// # Parameters
<a href=#85 id=85 data-nosnippet>85</a>/// - `data`: The sorted vector to search.
<a href=#86 id=86 data-nosnippet>86</a>/// - `predicate`: Function that returns true for the target element.
<a href=#87 id=87 data-nosnippet>87</a>///
<a href=#88 id=88 data-nosnippet>88</a>/// # Returns
<a href=#89 id=89 data-nosnippet>89</a>/// The index of the found element, or None if not found.
<a href=#90 id=90 data-nosnippet>90</a>///
<a href=#91 id=91 data-nosnippet>91</a>/// # Examples
<a href=#92 id=92 data-nosnippet>92</a>/// ```rust
<a href=#93 id=93 data-nosnippet>93</a>/// use trash_analyzer::parallel::parallel_search;
<a href=#94 id=94 data-nosnippet>94</a>///
<a href=#95 id=95 data-nosnippet>95</a>/// let data = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
<a href=#96 id=96 data-nosnippet>96</a>///
<a href=#97 id=97 data-nosnippet>97</a>/// let index = parallel_search(&data, |&x| x == 7);
<a href=#98 id=98 data-nosnippet>98</a>/// assert_eq!(index, Some(6));
<a href=#99 id=99 data-nosnippet>99</a>/// ```
<a href=#100 id=100 data-nosnippet>100</a></span><span class="kw">pub fn </span>parallel_search<T, F>(data: <span class="kw-2">&</span>[T], predicate: F) -> <span class="prelude-ty">Option</span><usize>
<a href=#101 id=101 data-nosnippet>101</a><span class="kw">where
<a href=#102 id=102 data-nosnippet>102</a> </span>T: Send + Sync,
<a href=#103 id=103 data-nosnippet>103</a> F: Fn(<span class="kw-2">&</span>T) -> bool + Send + Sync,
<a href=#104 id=104 data-nosnippet>104</a>{
<a href=#105 id=105 data-nosnippet>105</a> data.iter()
<a href=#106 id=106 data-nosnippet>106</a> .enumerate()
<a href=#107 id=107 data-nosnippet>107</a> .find(|(<span class="kw">_</span>, item)| predicate(item))
<a href=#108 id=108 data-nosnippet>108</a> .map(|(i, <span class="kw">_</span>)| i)
<a href=#109 id=109 data-nosnippet>109</a>}</code></pre></div></section></main></body></html>