Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
z_algorithm_example.cc
Go to the documentation of this file.
1/*
2 Aleph_w
3
4 Data structures & Algorithms
5 version 2.0.0b
6 https://github.com/lrleon/Aleph-w
7
8 This file is part of Aleph-w library
9
10 Copyright (c) 2002-2026 Leandro Rabindranath Leon
11
12 Permission is hereby granted, free of charge, to any person obtaining a copy
13 of this software and associated documentation files (the "Software"), to deal
14 in the Software without restriction, including without limitation the rights
15 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
16 copies of the Software, and to permit persons to whom the Software is
17 furnished to do so, subject to the following conditions:
18
19 The above copyright notice and this permission notice shall be included in all
20 copies or substantial portions of the Software.
21
22 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
23 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
24 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
25 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
26 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
27 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 SOFTWARE.
29*/
30
31
37# include <iostream>
38# include <string>
39# include <format>
40
41# include <String_Search.H>
42
43using namespace Aleph;
44
45template <typename Range>
56void print_range(std::string_view label, const Range & r)
57{
58 std::cout << label << ": ";
59 for (const auto & item : r)
60 std::cout << std::format("{} ", item);
61 std::cout << "\n";
62}
63
72int main()
73{
74 const std::string text = "aabcaabxaaaz";
75 const std::string pattern = "aab";
76
77 const auto z = z_algorithm(text);
78 const auto matches = z_search(text, pattern);
79
80 std::cout << std::format("Z-Algorithm Example\nText : {}\nPattern: {}\n\n",
81 text, pattern);
82
83 print_range("Z-array", z);
84 print_range("Matches at positions", matches);
85
86 return 0;
87}
Classical pattern searching algorithms over strings.
Main namespace for Aleph-w library functions.
Definition ah-arena.H:89
Array< size_t > z_search(const std::string_view text, const std::string_view pattern)
Find all occurrences of a pattern using the Z-algorithm.
Array< size_t > z_algorithm(const std::string_view s)
Compute Z-array for a string.
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
gsl_rng * r
void print_range(std::string_view label, const Range &r)
Print a label followed by the elements of a range to standard output.
int main()
Example program demonstrating computation of the Z-array and pattern matches using the Z-algorithm.