HTL-2IHIF-C/24-timed-sorting-4
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Initial commit

Browse source
This commit is contained in:
github-classroom[bot] 2025-04-28 22:11:20 +00:00 • committed by GitHub
commit b4c0b22597
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
104 changed files with 10100 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

BIN
html/bc_s.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 676 B

BIN
html/bdwn.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 147 B

BIN
html/closed.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 132 B

BIN
html/doc.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 746 B

1730
html/doxygen.css Normal file
View file

File diff suppressed because it is too large Load diff

BIN
html/doxygen.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 3.7 KiB

14
html/doxygen_extra.css Normal file
View file

@ -0,0 +1,14 @@
code {
background: #eaeaea;
padding: 0 0.3em;
border-radius: 4px;
}
div.fragment {
padding: 0.5em;
border-radius: 4px;
margin: 1em 0;
}
div.line {
line-height: 1.4;
}

121
html/dynsections.js Normal file
View file

@ -0,0 +1,121 @@
/*
@licstart The following is the entire license notice for the JavaScript code in this file.
The MIT License (MIT)
Copyright (C) 1997-2020 by Dimitri van Heesch
Permission is hereby granted, free of charge, to any person obtaining a copy of this software
and associated documentation files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge, publish, distribute,
sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or
substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@licend The above is the entire license notice for the JavaScript code in this file
*/
function toggleVisibility(linkObj)
{
var base = $(linkObj).attr('id');
var summary = $('#'+base+'-summary');
var content = $('#'+base+'-content');
var trigger = $('#'+base+'-trigger');
var src=$(trigger).attr('src');
if (content.is(':visible')===true) {
content.hide();
summary.show();
$(linkObj).addClass('closed').removeClass('opened');
$(trigger).attr('src',src.substring(0,src.length-8)+'closed.png');
} else {
content.show();
summary.hide();
$(linkObj).removeClass('closed').addClass('opened');
$(trigger).attr('src',src.substring(0,src.length-10)+'open.png');
}
return false;
}
function updateStripes()
{
$('table.directory tr').
removeClass('even').filter(':visible:even').addClass('even');
}
function toggleLevel(level)
{
$('table.directory tr').each(function() {
var l = this.id.split('_').length-1;
var i = $('#img'+this.id.substring(3));
var a = $('#arr'+this.id.substring(3));
if (l<level+1) {
i.removeClass('iconfopen iconfclosed').addClass('iconfopen');
a.html('&#9660;');
$(this).show();
} else if (l==level+1) {
i.removeClass('iconfclosed iconfopen').addClass('iconfclosed');
a.html('&#9658;');
$(this).show();
} else {
$(this).hide();
}
});
updateStripes();
}
function toggleFolder(id)
{
// the clicked row
var currentRow = $('#row_'+id);
// all rows after the clicked row
var rows = currentRow.nextAll("tr");
var re = new RegExp('^row_'+id+'\\d+_$', "i"); //only one sub
// only match elements AFTER this one (can't hide elements before)
var childRows = rows.filter(function() { return this.id.match(re); });
// first row is visible we are HIDING
if (childRows.filter(':first').is(':visible')===true) {
// replace down arrow by right arrow for current row
var currentRowSpans = currentRow.find("span");
currentRowSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed");
currentRowSpans.filter(".arrow").html('&#9658;');
rows.filter("[id^=row_"+id+"]").hide(); // hide all children
} else { // we are SHOWING
// replace right arrow by down arrow for current row
var currentRowSpans = currentRow.find("span");
currentRowSpans.filter(".iconfclosed").removeClass("iconfclosed").addClass("iconfopen");
currentRowSpans.filter(".arrow").html('&#9660;');
// replace down arrows by right arrows for child rows
var childRowsSpans = childRows.find("span");
childRowsSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed");
childRowsSpans.filter(".arrow").html('&#9658;');
childRows.show(); //show all children
}
updateStripes();
}
function toggleInherit(id)
{
var rows = $('tr.inherit.'+id);
var img = $('tr.inherit_header.'+id+' img');
var src = $(img).attr('src');
if (rows.filter(':first').is(':visible')===true) {
rows.css('display','none');
$(img).attr('src',src.substring(0,src.length-8)+'closed.png');
} else {
rows.css('display','table-row'); // using show() causes jump in firefox
$(img).attr('src',src.substring(0,src.length-10)+'open.png');
}
}
/* @license-end */

82
html/files.html Normal file
View file

@ -0,0 +1,82 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Sorting and Searching Algorithms: File List</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen_extra.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Sorting and Searching Algorithms
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">File List</div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here is a list of all files with brief descriptions:</div><div class="directory">
<table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a href="mainpage_8h_source.html"><span class="icondoc"></span></a><a class="el" href="mainpage_8h.html" target="_self">mainpage.h</a></td><td class="desc"></td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Apr 14 2021 12:09:56 for Sorting and Searching Algorithms by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.18
</small></address>
</body>
</html>

BIN
html/folderclosed.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 616 B

BIN
html/folderopen.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 597 B

300
html/index.html Normal file
View file

@ -0,0 +1,300 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Sorting and Searching Algorithms: Main Page</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen_extra.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Sorting and Searching Algorithms
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="PageDoc"><div class="header">
<div class="headertitle">
<div class="title">Sorting and Searching Algorithms Documentation</div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><h1><a class="anchor" id="intro"></a>
Introduction</h1>
<p>The implementation and evaluation of a collection of Sorting and Searching Algorithms.</p>
<h1><a class="anchor" id="objective"></a>
Assignment Objective</h1>
<p>The target collection those algorithms are operation on, is an 'Array Backed List'. This list shares (almost) the same interface (<code>list.h</code>) as the linked list from previous assignments but is implemented based on an array. Different sorting and searching algorithms are to be implemented using that list. A stopwatch shall be implemented that is used to measure the time a certain algorithm requires to sort or search. Eventually the measured times for defined number of list items and algorithms are compared.</p>
<p><b>Configuration</b></p>
<p>The capacity of the backing array of the list is defined in <code>config.h</code> as <code>#define CAPACITY_INCREMENT</code>. This value defines also the number of items for enlarging the backing array. This means, the array grows always in steps of <code>CAPACITY_INCREMENT</code> items.</p>
<h1><a class="anchor" id="assignment"></a>
Assignment</h1>
<p>In this assignment various sorting and search algorithms shall be implemented in multiple steps.</p>
<p><b>Step 1:</b></p>
<ul>
<li>Implemenation of an 'Array Backed List' by implementing files <code>array_backed_list.h</code>. This file implements <code>list.h</code> using an array as underlying collection instead of a linked list. In contrast to earlier assignments, the function <code>list_append(…)</code> was removed and <code>list_swap(…)</code> was added. The array shall have a certain capacity and need to be increased (with all consequences, such as of copying items) if another item is added to a 'full' list. As a benefit, random access to items is fast, which is required by (most) sorting and searching algorithms. For implementation details read and follow the instructions in file <code>array_backed_list.c</code>.</li>
</ul>
<p><b>Step 2:</b></p>
<ul>
<li>Implementation of the infrastructure for selecting and using sorting and searching algorithms as well as for measuring the time a certain algorithm takes for completing its operation.</li>
<li>Implementation of bubble sort algorithm</li>
<li>Implementation of insertion algorithm</li>
<li>Implementation of sorting criteria that can be applied as paramter to the algorithm (function pointer)</li>
</ul>
<p><b>Step 3:</b></p>
<ul>
<li>Implementation of merge sort algorithm</li>
<li>Extension of list as required</li>
</ul>
<p><b>Step 4:</b></p>
<ul>
<li>Implementation of quick sort algorithm</li>
<li>Implementation of linear search algorithm</li>
<li>Implementation of binary search algorithm</li>
<li>Implementation of insertion sort algorithm using binary search</li>
</ul>
<h1><a class="anchor" id="instructions"></a>
Working Instructions</h1>
<p>The library 'allocator' is provided for memory allocation functionality that integrates with unit testing. Behind the facade, allocats memory dynamically similar to <code>malloc</code>. Allocated memory must be freed when it is not used anymore. The 'allocator' library must be used for memory alloction operations, otherwise unit tests will fail.</p>
<p><b>Step 1:</b></p>
<ol type="1">
<li>Implement 'array_backed_list.c' against interface indirectly declared in 'list.h': Make the program and tests compile: Implement all functions in all relevant files declared in the headers EMTPY (return nothing, 0, false, ... as required).<ul>
<li>All unit tests shall run but FAIL after this step</li>
<li><b>&ndash;COMMIT&ndash;</b></li>
</ul>
</li>
<li>Implement the empty functions one by one to make the unit tests.<ul>
<li>Because most unit tests depends on <code>list_obtain(…)</code>, <code>list_release(…)</code>, <code>list_is_valid(…)</code>, <code>list_is_empty(…)</code>, <code>list_insert(…)</code>, and <code>list_get_size(…)</code> it makes sense to implement those functions in one step.</li>
<li>The purpose of a function is specified as API documentation within the header files.</li>
<li>Obey comments in source files. Run the unit tests frequently and fix failures.</li>
<li><b>&ndash;COMMIT&ndash; after each implemented function.</b></li>
</ul>
</li>
</ol>
<p><b>Step 2:</b></p><ol type="1">
<li>Based on 'array_backed_list' from step 1. If you don't own an implementation of that list (for good reasons), then:<ol type="a">
<li>Implement the sorting algorithms based on a large, simple array (length: &gt;= 2^16, see below).</li>
<li>Comment the <code>#define LIST_VARIANT</code> in <code>config.h</code> to enable the functions using arrays and disable those for the list.</li>
<li><b>Note</b> Only one variant (list OR array) need to be implemented.</li>
</ol>
</li>
<li>Implement all functions defined by the files below empty to make the program compile. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>stopwatch.[h|c]</code> Implement the <code>stopwatch</code>. The stopwatch is required to measure the runtime of algorithms or execution steps. Details about the implementation of the stopwatch can be found in <code>stopwatch.c</code>. Run the unit tests targeting stop watch functionality and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>sorting_criteria.[h|c]</code>: Implement the sorting criteria function and the define the function pointer type for those functions. Run the unit tests targeting the sorting criteria functions and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>bubble_sort.[h|c]</code>: Implement the bubble sort algorithm. Run the unit tests targeting the bubble sort algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>insertion_sort.[h|c]</code>: Implement the insertion sort algorithm. Run the unit tests targeting the insertion sort algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>sorting.[h|c]</code>: Implement the support functions for the sorting application. These functions include initialization, printing (optional), and selection of the desired sorting algorithm. It also declares an enumeration of all supported sorting algorithms. Details regarding the implementation of those functions are mentioned in the top section of <code>sorting.c</code>. Run the unit tests targeting the sorting support function and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><p class="startli"><code>timed_sorting_main_driver.c</code>: Implement the body of the measurement application. Organize the main application file as wanted. The application shall measure the time for sorting data of different size with all supported algorithms for the average, the best, and the worst case. In addition, it shall measure the time required for setting up and tearing down the data structure.</p>
<p class="startli">For each supported sorting algorithm defined in <code>sorting.h</code>, starting with an item count of 1:</p><ol type="a">
<li>Obtain the data structure (list or array) and initialize it randomly using the according function of <code>sorting.h</code>. Measure the time for this step as 'Init' time.</li>
<li>Sort the data using the selected algorithm and measure the time for this step as 'Sort Avg' time.</li>
<li>Sort the data using the selected algorithm again (in the same direction) and measure the time for this step as 'Sort Best' time.</li>
<li>Sort the data using the selected algorithm in reverse direction and measure the time for this step as 'Sort Worst' time.</li>
<li>Release the data structure (if applicable) and measure the time for this step as 'Release' time.</li>
<li>Print the measured times as described below.</li>
<li>Double the number of items to sort and repeat at step a) as long the item counter is less than 20k or 50k item (depending on your system).</li>
</ol>
<p class="startli"><b>&ndash;COMMIT&ndash;</b></p>
<p class="startli">The print outs as described above shall produce a table as shown below. The format pattern for the item count should be <code>%7d</code> and <code>%10.1f</code> for time values. Pipes <code>|</code> herein are not part of the format, they are just reqired for markdown. Such a data table can be examined further in a spreadsheet application such as MS Excel. Describe your observations, verify the runtime complexity based on your time measurements.</p>
<p class="startli"><b>Note:</b>: You can take time measurements using different value for <code>CAPACITY_INCREMENT</code>. Only <code>Init</code> time should differ significantly.</p>
</li>
</ol>
<table class="markdownTable">
<tr class="markdownTableHead">
<th class="markdownTableHeadLeft">Algorithm; </th><th class="markdownTableHeadRight">Items; </th><th class="markdownTableHeadRight">Sort_Random; </th><th class="markdownTableHeadRight">Sort_Sorted; </th><th class="markdownTableHeadRight">Sort_Reverse; </th><th class="markdownTableHeadRight">Init; </th><th class="markdownTableHeadRight">Release </th></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">1; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">5.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">2; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">0.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">4; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">8; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">0.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">16; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">32; </td><td class="markdownTableBodyRight">10.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">10.0; </td><td class="markdownTableBodyRight">17.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">64; </td><td class="markdownTableBodyRight">36.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">40.0; </td><td class="markdownTableBodyRight">4.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">128; </td><td class="markdownTableBodyRight">143.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">156.0; </td><td class="markdownTableBodyRight">5.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">256; </td><td class="markdownTableBodyRight">622.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">1676.0; </td><td class="markdownTableBodyRight">7.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">512; </td><td class="markdownTableBodyRight">2697.0; </td><td class="markdownTableBodyRight">7.0; </td><td class="markdownTableBodyRight">2855.0; </td><td class="markdownTableBodyRight">14.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">1024; </td><td class="markdownTableBodyRight">12267.0; </td><td class="markdownTableBodyRight">12.0; </td><td class="markdownTableBodyRight">11984.0; </td><td class="markdownTableBodyRight">23.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">2048; </td><td class="markdownTableBodyRight">43619.0; </td><td class="markdownTableBodyRight">25.0; </td><td class="markdownTableBodyRight">44301.0; </td><td class="markdownTableBodyRight">42.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">4096; </td><td class="markdownTableBodyRight">169480.0; </td><td class="markdownTableBodyRight">49.0; </td><td class="markdownTableBodyRight">181360.0; </td><td class="markdownTableBodyRight">78.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">8192; </td><td class="markdownTableBodyRight">667259.0; </td><td class="markdownTableBodyRight">98.0; </td><td class="markdownTableBodyRight">714083.0; </td><td class="markdownTableBodyRight">157.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">16384; </td><td class="markdownTableBodyRight">2683571.0; </td><td class="markdownTableBodyRight">350.0; </td><td class="markdownTableBodyRight">2837608.0; </td><td class="markdownTableBodyRight">408.0; </td><td class="markdownTableBodyRight">33.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">32768; </td><td class="markdownTableBodyRight">10263822.0; </td><td class="markdownTableBodyRight">571.0; </td><td class="markdownTableBodyRight">11325744.0; </td><td class="markdownTableBodyRight">1879.0; </td><td class="markdownTableBodyRight">31.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">1; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">218.0; </td><td class="markdownTableBodyRight">0.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">2; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">4; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">8; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">0.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">16; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">0.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">32; </td><td class="markdownTableBodyRight">5.0; </td><td class="markdownTableBodyRight">1.0; </td><td class="markdownTableBodyRight">7.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">0.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">64; </td><td class="markdownTableBodyRight">15.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">29.0; </td><td class="markdownTableBodyRight">2.0; </td><td class="markdownTableBodyRight">0.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">128; </td><td class="markdownTableBodyRight">60.0; </td><td class="markdownTableBodyRight">3.0; </td><td class="markdownTableBodyRight">114.0; </td><td class="markdownTableBodyRight">4.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">256; </td><td class="markdownTableBodyRight">219.0; </td><td class="markdownTableBodyRight">5.0; </td><td class="markdownTableBodyRight">583.0; </td><td class="markdownTableBodyRight">6.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">512; </td><td class="markdownTableBodyRight">1010.0; </td><td class="markdownTableBodyRight">12.0; </td><td class="markdownTableBodyRight">2026.0; </td><td class="markdownTableBodyRight">11.0; </td><td class="markdownTableBodyRight">1.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">1024; </td><td class="markdownTableBodyRight">4066.0; </td><td class="markdownTableBodyRight">28.0; </td><td class="markdownTableBodyRight">8800.0; </td><td class="markdownTableBodyRight">32.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">2048; </td><td class="markdownTableBodyRight">16718.0; </td><td class="markdownTableBodyRight">80.0; </td><td class="markdownTableBodyRight">33491.0; </td><td class="markdownTableBodyRight">35.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">4096; </td><td class="markdownTableBodyRight">64592.0; </td><td class="markdownTableBodyRight">205.0; </td><td class="markdownTableBodyRight">129536.0; </td><td class="markdownTableBodyRight">69.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">8192; </td><td class="markdownTableBodyRight">259646.0; </td><td class="markdownTableBodyRight">670.0; </td><td class="markdownTableBodyRight">524065.0; </td><td class="markdownTableBodyRight">142.0; </td><td class="markdownTableBodyRight">2.0 </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">16384; </td><td class="markdownTableBodyRight">1094843.0; </td><td class="markdownTableBodyRight">2327.0; </td><td class="markdownTableBodyRight">2075412.0; </td><td class="markdownTableBodyRight">360.0; </td><td class="markdownTableBodyRight">24.0 </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Insertion Sort; </td><td class="markdownTableBodyRight">32768; </td><td class="markdownTableBodyRight">4188706.0; </td><td class="markdownTableBodyRight">10525.0; </td><td class="markdownTableBodyRight">8367830.0; </td><td class="markdownTableBodyRight">1677.0; </td><td class="markdownTableBodyRight">34.0 </td></tr>
</table>
<p><b>Step 3:</b></p><ol type="1">
<li>Copy all header and source files that need to be implemented in this assignment but have been already developed in earlier steps (esp. step 2) from YOUR solution to this assignment. Do not copy unit tests! <b>&ndash;COMMIT&ndash;</b></li>
<li>Based on 'array_backed_list' from step 2. If you don't own an implementation of that list (for good reasons), then:<ol type="a">
<li>Implement the sorting algorithms based on a large, simple array (length: &gt;= 2^16, see below).</li>
<li>Comment the <code>#define LIST_VARIANT</code> in <code>config.h</code> to enable the functions using arrays and disable those for the list.</li>
<li><b>Note</b> Only one variant (list OR array) need to be implemented.</li>
</ol>
</li>
<li>Implement all functions defined by the file below empty to make the program compile. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>array_backed_list.c</code>: (list variant only)<ol type="a">
<li>Implement the additional functions as defined in <code>list.h</code><ul>
<li><code>list_append</code></li>
<li><code>list_split</code></li>
<li><code>list_transfer_head</code> <b>&ndash;COMMIT&ndash;</b></li>
</ul>
</li>
</ol>
</li>
<li><code>merge_sort.[h|c]</code>: Implement the merge sort algorithm. Run the unit tests targeting the merge sort algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>sorting.[h|c]</code>: Extend the functions that delegates to different sorting algorithms to support MERGE_SORT. Run the unit tests targeting the sorting support function and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li>Run the application. The output shown above for step 2 should be extended for Merge Sort.</li>
</ol>
<p><b>Step 4:</b></p><ol type="1">
<li>Copy all header and source files that need to be implemented in this assignment but have been already developed in earlier steps (esp. step 3) from YOUR solution to this assignment. Do not copy unit tests! <b>&ndash;COMMIT&ndash;</b></li>
<li>Based on 'array_backed_list' from step 3. If you don't own an implementation of that list (for good reasons), then:<ol type="a">
<li>Implement the sorting algorithms based on a large, simple array (length: &gt;= 2^16, see below).</li>
<li>Comment the <code>#define LIST_VARIANT</code> in <code>config.h</code> to enable the functions using arrays and disable those for the list.</li>
<li><b>Note</b> Only one variant (list OR array) need to be implemented.</li>
</ol>
</li>
<li>Implement all functions defined by the file below empty to make the program compile. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>quick_sort.[h|c]</code>: Implement the quick sort algorithm. Run the unit tests targeting the quick sort algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>insertion_sort_binary_search.[h|c]</code>: Implement the insertion sort algorithm that uses binary search for finding the insert position. The insertion sort algorithm implemented in step 2 can be reused and modified. Run the unit tests targeting the insertion sort with binary search algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>sorting.[h|c]</code>: Extend the functions that delegates to different sorting algorithms to support QUICK_SORT and INSERTION_SORT_BINARY_SEARCH. Run the unit tests targeting the sorting support function and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>linear_search.[h|c]</code>: Implement the linear search algorithm. Run the unit tests targeting the linear search algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><code>binary_search.[h|c]</code>: Implement the binary search algorithm. Run the unit tests targeting the binary search algorithm and make them green. <b>&ndash;COMMIT&ndash;</b></li>
<li><p class="startli"><code>timed_sorting_main_driver.c</code>: Extend the application with measurement for search algorithms. Organize the main application file as wanted. In addition the application shall measure the time for searching a value using linear search and binary search within a long (&gt; 16k items) list or array. The time for searching every Xth item that is contained in the list or array shall be measured for each search algorithm, X may be ~100.</p>
<p class="startli"><b>Note:</b> Especially for binary search, measuring one search execution may result in values beyond measurable range. Therefore the time measurement of a single item shall invoke the search function Y times (Y &gt;= 10). The accumulated measured result need them be divided by Y (time = measured_time/Y).</p>
<p class="startli">The print-out for these measurements may look like: </p><table class="markdownTable">
<tr class="markdownTableHead">
<th class="markdownTableHeadLeft">Algorithm; </th><th class="markdownTableHeadRight">Index; </th><th class="markdownTableHeadRight">Time; </th></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Bubble Sort; </td><td class="markdownTableBodyRight">1; </td><td class="markdownTableBodyRight">1.0; </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Linear Search; </td><td class="markdownTableBodyRight">0; </td><td class="markdownTableBodyRight">0.1; </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Binary Search; </td><td class="markdownTableBodyRight">0; </td><td class="markdownTableBodyRight">0.1; </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Linear Search; </td><td class="markdownTableBodyRight">128; </td><td class="markdownTableBodyRight">0.5; </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Binary Search; </td><td class="markdownTableBodyRight">128; </td><td class="markdownTableBodyRight">0.2; </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Linear Search; </td><td class="markdownTableBodyRight">256; </td><td class="markdownTableBodyRight">0.7; </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Binary Search; </td><td class="markdownTableBodyRight">256; </td><td class="markdownTableBodyRight">0.1; </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Linear Search; </td><td class="markdownTableBodyRight">384; </td><td class="markdownTableBodyRight">1.0; </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Binary Search; </td><td class="markdownTableBodyRight">384; </td><td class="markdownTableBodyRight">0.2; </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">Linear Search; </td><td class="markdownTableBodyRight">512; </td><td class="markdownTableBodyRight">1.2; </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">Binary Search; </td><td class="markdownTableBodyRight">512; </td><td class="markdownTableBodyRight">0.1; </td></tr>
</table>
</li>
<li>Run the application. The output shown above for step 2 should be extended for Quick Sort and Insertion Sort with Binary Search as well as with the measurements for search algorithms as shown above.</li>
</ol>
<h1><a class="anchor" id="notes"></a>
Notes</h1>
<ol type="1">
<li><code>general.h</code> contains macros for finding the minimum, maximum, and absolute value</li>
<li>make cleantest: This new make target for clearing the console, building, and running unit test is available.</li>
<li>Sometimes changes are not properly detected by incremental builds. If something very strange happens during compilation, try to run <code>make clean</code> followed by <code>make</code> to start a clean build. This approach is also recommended after everthing is done, because some compiler warning appears only in clean builds. </li>
</ol>
</div></div><!-- PageDoc -->
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Apr 14 2021 12:09:56 for Sorting and Searching Algorithms by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.18
</small></address>
</body>
</html>

35
html/jquery.js vendored Normal file
View file

File diff suppressed because one or more lines are too long

79
html/mainpage_8h.html Normal file
View file

@ -0,0 +1,79 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Sorting and Searching Algorithms: mainpage.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen_extra.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Sorting and Searching Algorithms
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">mainpage.h File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p><a href="mainpage_8h_source.html">Go to the source code of this file.</a></p>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Apr 14 2021 12:09:56 for Sorting and Searching Algorithms by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.18
</small></address>
</body>
</html>

78
html/mainpage_8h_source.html Normal file
View file

@ -0,0 +1,78 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Sorting and Searching Algorithms: mainpage.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen_extra.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Sorting and Searching Algorithms
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">mainpage.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="mainpage_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160; </div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Apr 14 2021 12:09:56 for Sorting and Searching Algorithms by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.18
</small></address>
</body>
</html>

51
html/menu.js Normal file
View file

@ -0,0 +1,51 @@
/*
@licstart The following is the entire license notice for the JavaScript code in this file.
The MIT License (MIT)
Copyright (C) 1997-2020 by Dimitri van Heesch
Permission is hereby granted, free of charge, to any person obtaining a copy of this software
and associated documentation files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge, publish, distribute,
sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or
substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@licend The above is the entire license notice for the JavaScript code in this file
*/
function initMenu(relPath,searchEnabled,serverSide,searchPage,search) {
function makeTree(data,relPath) {
var result='';
if ('children' in data) {
result+='<ul>';
for (var i in data.children) {
result+='<li><a href="'+relPath+data.children[i].url+'">'+
data.children[i].text+'</a>'+
makeTree(data.children[i],relPath)+'</li>';
}
result+='</ul>';
}
return result;
}
$('#main-nav').append(makeTree(menudata,relPath));
$('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu');
if (searchEnabled) {
if (serverSide) {
$('#main-menu').append('<li style="float:right"><div id="MSearchBox" class="MSearchBoxInactive"><div class="left"><form id="FSearchBox" action="'+relPath+searchPage+'" method="get"><img id="MSearchSelect" src="'+relPath+'search/mag.png" alt=""/><input type="text" id="MSearchField" name="query" value="'+search+'" size="20" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)"></form></div><div class="right"></div></div></li>');
} else {
$('#main-menu').append('<li style="float:right"><div id="MSearchBox" class="MSearchBoxInactive"><span class="left"><img id="MSearchSelect" src="'+relPath+'search/mag_sel.png" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()" alt=""/><input type="text" id="MSearchField" value="'+search+'" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)" onkeyup="searchBox.OnSearchFieldChange(event)"/></span><span class="right"><a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="'+relPath+'search/close.png" alt=""/></a></span></div></li>');
}
}
$('#main-menu').smartmenus();
}
/* @license-end */

28
html/menudata.js Normal file
View file

@ -0,0 +1,28 @@
/*
@licstart The following is the entire license notice for the JavaScript code in this file.
The MIT License (MIT)
Copyright (C) 1997-2020 by Dimitri van Heesch
Permission is hereby granted, free of charge, to any person obtaining a copy of this software
and associated documentation files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge, publish, distribute,
sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or
substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@licend The above is the entire license notice for the JavaScript code in this file
*/
var menudata={children:[
{text:"Main Page",url:"index.html"},
{text:"Files",url:"files.html",children:[
{text:"File List",url:"files.html"}]}]}

BIN
html/nav_f.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 153 B

BIN
html/nav_g.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 95 B

BIN
html/nav_h.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 98 B

BIN
html/open.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 123 B

36
html/search/all_0.html Normal file
View file

@ -0,0 +1,36 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html><head><title></title>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<link rel="stylesheet" type="text/css" href="search.css"/>
<script type="text/javascript" src="all_0.js"></script>
<script type="text/javascript" src="search.js"></script>
</head>
<body class="SRPage">
<div id="SRIndex">
<div class="SRStatus" id="Loading">Loading...</div>
<div id="SRResults"></div>
<script type="text/javascript"><!--
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
createResults();
/* @license-end */
--></script>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
<script type="text/javascript"><!--
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
document.getElementById("Loading").style.display="none";
document.getElementById("NoMatches").style.display="none";
var searchResults = new SearchResults("searchResults");
searchResults.Search();
window.addEventListener("message", function(event) {
if (event.data == "take_focus") {
var elem = searchResults.NavNext(0);
if (elem) elem.focus();
}
});
/* @license-end */
--></script>
</div>
</body>
</html>

4
html/search/all_0.js Normal file
View file

@ -0,0 +1,4 @@
var searchData=
[
['mainpage_2eh_0',['mainpage.h',['../mainpage_8h.html',1,'']]]
];

BIN
html/search/close.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 273 B

36
html/search/files_0.html Normal file
View file

@ -0,0 +1,36 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html><head><title></title>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<link rel="stylesheet" type="text/css" href="search.css"/>
<script type="text/javascript" src="files_0.js"></script>
<script type="text/javascript" src="search.js"></script>
</head>
<body class="SRPage">
<div id="SRIndex">
<div class="SRStatus" id="Loading">Loading...</div>
<div id="SRResults"></div>
<script type="text/javascript"><!--
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
createResults();
/* @license-end */
--></script>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
<script type="text/javascript"><!--
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
document.getElementById("Loading").style.display="none";
document.getElementById("NoMatches").style.display="none";
var searchResults = new SearchResults("searchResults");
searchResults.Search();
window.addEventListener("message", function(event) {
if (event.data == "take_focus") {
var elem = searchResults.NavNext(0);
if (elem) elem.focus();
}
});
/* @license-end */
--></script>
</div>
</body>
</html>

4
html/search/files_0.js Normal file
View file

@ -0,0 +1,4 @@
var searchData=
[
['mainpage_2eh_1',['mainpage.h',['../mainpage_8h.html',1,'']]]
];

BIN
html/search/mag_sel.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 465 B

12
html/search/nomatches.html Normal file
View file

@ -0,0 +1,12 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html><head><title></title>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<link rel="stylesheet" type="text/css" href="search.css"/>
<script type="text/javascript" src="search.js"></script>
</head>
<body class="SRPage">
<div id="SRIndex">
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</body>
</html>

271
html/search/search.css Normal file
View file

@ -0,0 +1,271 @@
/*---------------- Search Box */
#FSearchBox {
float: left;
}
#MSearchBox {
white-space : nowrap;
float: none;
margin-top: 8px;
right: 0px;
width: 170px;
height: 24px;
z-index: 102;
}
#MSearchBox .left
{
display:block;
position:absolute;
left:10px;
width:20px;
height:19px;
background:url('search_l.png') no-repeat;
background-position:right;
}
#MSearchSelect {
display:block;
position:absolute;
width:20px;
height:19px;
}
.left #MSearchSelect {
left:4px;
}
.right #MSearchSelect {
right:5px;
}
#MSearchField {
display:block;
position:absolute;
height:19px;
background:url('search_m.png') repeat-x;
border:none;
width:115px;
margin-left:20px;
padding-left:4px;
color: #909090;
outline: none;
font: 9pt Arial, Verdana, sans-serif;
-webkit-border-radius: 0px;
}
#FSearchBox #MSearchField {
margin-left:15px;
}
#MSearchBox .right {
display:block;
position:absolute;
right:10px;
top:8px;
width:20px;
height:19px;
background:url('search_r.png') no-repeat;
background-position:left;
}
#MSearchClose {
display: none;
position: absolute;
top: 4px;
background : none;
border: none;
margin: 0px 4px 0px 0px;
padding: 0px 0px;
outline: none;
}
.left #MSearchClose {
left: 6px;
}
.right #MSearchClose {
right: 2px;
}
.MSearchBoxActive #MSearchField {
color: #000000;
}
/*---------------- Search filter selection */
#MSearchSelectWindow {
display: none;
position: absolute;
left: 0; top: 0;
border: 1px solid #90A5CE;
background-color: #F9FAFC;
z-index: 10001;
padding-top: 4px;
padding-bottom: 4px;
-moz-border-radius: 4px;
-webkit-border-top-left-radius: 4px;
-webkit-border-top-right-radius: 4px;
-webkit-border-bottom-left-radius: 4px;
-webkit-border-bottom-right-radius: 4px;
-webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15);
}
.SelectItem {
font: 8pt Arial, Verdana, sans-serif;
padding-left: 2px;
padding-right: 12px;
border: 0px;
}
span.SelectionMark {
margin-right: 4px;
font-family: monospace;
outline-style: none;
text-decoration: none;
}
a.SelectItem {
display: block;
outline-style: none;
color: #000000;
text-decoration: none;
padding-left: 6px;
padding-right: 12px;
}
a.SelectItem:focus,
a.SelectItem:active {
color: #000000;
outline-style: none;
text-decoration: none;
}
a.SelectItem:hover {
color: #FFFFFF;
background-color: #3D578C;
outline-style: none;
text-decoration: none;
cursor: pointer;
display: block;
}
/*---------------- Search results window */
iframe#MSearchResults {
width: 60ex;
height: 15em;
}
#MSearchResultsWindow {
display: none;
position: absolute;
left: 0; top: 0;
border: 1px solid #000;
background-color: #EEF1F7;
z-index:10000;
}
/* ----------------------------------- */
#SRIndex {
clear:both;
padding-bottom: 15px;
}
.SREntry {
font-size: 10pt;
padding-left: 1ex;
}
.SRPage .SREntry {
font-size: 8pt;
padding: 1px 5px;
}
body.SRPage {
margin: 5px 2px;
}
.SRChildren {
padding-left: 3ex; padding-bottom: .5em
}
.SRPage .SRChildren {
display: none;
}
.SRSymbol {
font-weight: bold;
color: #425E97;
font-family: Arial, Verdana, sans-serif;
text-decoration: none;
outline: none;
}
a.SRScope {
display: block;
color: #425E97;
font-family: Arial, Verdana, sans-serif;
text-decoration: none;
outline: none;
}
a.SRSymbol:focus, a.SRSymbol:active,
a.SRScope:focus, a.SRScope:active {
text-decoration: underline;
}
span.SRScope {
padding-left: 4px;
}
.SRPage .SRStatus {
padding: 2px 5px;
font-size: 8pt;
font-style: italic;
}
.SRResult {
display: none;
}
DIV.searchresults {
margin-left: 10px;
margin-right: 10px;
}
/*---------------- External search page results */
.searchresult {
background-color: #F0F3F8;
}
.pages b {
color: white;
padding: 5px 5px 3px 5px;
background-image: url("../tab_a.png");
background-repeat: repeat-x;
text-shadow: 0 1px 1px #000000;
}
.pages {
line-height: 17px;
margin-left: 4px;
text-decoration: none;
}
.hl {
font-weight: bold;
}
#searchresults {
margin-bottom: 20px;
}
.searchpages {
margin-top: 10px;
}

814
html/search/search.js Normal file
View file

@ -0,0 +1,814 @@
/*
@licstart The following is the entire license notice for the JavaScript code in this file.
The MIT License (MIT)
Copyright (C) 1997-2020 by Dimitri van Heesch
Permission is hereby granted, free of charge, to any person obtaining a copy of this software
and associated documentation files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge, publish, distribute,
sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or
substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@licend The above is the entire license notice for the JavaScript code in this file
*/
function convertToId(search)
{
var result = '';
for (i=0;i<search.length;i++)
{
var c = search.charAt(i);
var cn = c.charCodeAt(0);
if (c.match(/[a-z0-9\u0080-\uFFFF]/))
{
result+=c;
}
else if (cn<16)
{
result+="_0"+cn.toString(16);
}
else
{
result+="_"+cn.toString(16);
}
}
return result;
}
function getXPos(item)
{
var x = 0;
if (item.offsetWidth)
{
while (item && item!=document.body)
{
x += item.offsetLeft;
item = item.offsetParent;
}
}
return x;
}
function getYPos(item)
{
var y = 0;
if (item.offsetWidth)
{
while (item && item!=document.body)
{
y += item.offsetTop;
item = item.offsetParent;
}
}
return y;
}
/* A class handling everything associated with the search panel.
Parameters:
name - The name of the global variable that will be
storing this instance. Is needed to be able to set timeouts.
resultPath - path to use for external files
*/
function SearchBox(name, resultsPath, inFrame, label)
{
if (!name || !resultsPath) { alert("Missing parameters to SearchBox."); }
// ---------- Instance variables
this.name = name;
this.resultsPath = resultsPath;
this.keyTimeout = 0;
this.keyTimeoutLength = 500;
this.closeSelectionTimeout = 300;
this.lastSearchValue = "";
this.lastResultsPage = "";
this.hideTimeout = 0;
this.searchIndex = 0;
this.searchActive = false;
this.insideFrame = inFrame;
this.searchLabel = label;
// ----------- DOM Elements
this.DOMSearchField = function()
{ return document.getElementById("MSearchField"); }
this.DOMSearchSelect = function()
{ return document.getElementById("MSearchSelect"); }
this.DOMSearchSelectWindow = function()
{ return document.getElementById("MSearchSelectWindow"); }
this.DOMPopupSearchResults = function()
{ return document.getElementById("MSearchResults"); }
this.DOMPopupSearchResultsWindow = function()
{ return document.getElementById("MSearchResultsWindow"); }
this.DOMSearchClose = function()
{ return document.getElementById("MSearchClose"); }
this.DOMSearchBox = function()
{ return document.getElementById("MSearchBox"); }
// ------------ Event Handlers
// Called when focus is added or removed from the search field.
this.OnSearchFieldFocus = function(isActive)
{
this.Activate(isActive);
}
this.OnSearchSelectShow = function()
{
var searchSelectWindow = this.DOMSearchSelectWindow();
var searchField = this.DOMSearchSelect();
if (this.insideFrame)
{
var left = getXPos(searchField);
var top = getYPos(searchField);
left += searchField.offsetWidth + 6;
top += searchField.offsetHeight;
// show search selection popup
searchSelectWindow.style.display='block';
left -= searchSelectWindow.offsetWidth;
searchSelectWindow.style.left = left + 'px';
searchSelectWindow.style.top = top + 'px';
}
else
{
var left = getXPos(searchField);
var top = getYPos(searchField);
top += searchField.offsetHeight;
// show search selection popup
searchSelectWindow.style.display='block';
searchSelectWindow.style.left = left + 'px';
searchSelectWindow.style.top = top + 'px';
}
// stop selection hide timer
if (this.hideTimeout)
{
clearTimeout(this.hideTimeout);
this.hideTimeout=0;
}
return false; // to avoid "image drag" default event
}
this.OnSearchSelectHide = function()
{
this.hideTimeout = setTimeout(this.name +".CloseSelectionWindow()",
this.closeSelectionTimeout);
}
// Called when the content of the search field is changed.
this.OnSearchFieldChange = function(evt)
{
if (this.keyTimeout) // kill running timer
{
clearTimeout(this.keyTimeout);
this.keyTimeout = 0;
}
var e = (evt) ? evt : window.event; // for IE
if (e.keyCode==40 || e.keyCode==13)
{
if (e.shiftKey==1)
{
this.OnSearchSelectShow();
var win=this.DOMSearchSelectWindow();
for (i=0;i<win.childNodes.length;i++)
{
var child = win.childNodes[i]; // get span within a
if (child.className=='SelectItem')
{
child.focus();
return;
}
}
return;
}
else
{
window.frames.MSearchResults.postMessage("take_focus", "*");
}
}
else if (e.keyCode==27) // Escape out of the search field
{
this.DOMSearchField().blur();
this.DOMPopupSearchResultsWindow().style.display = 'none';
this.DOMSearchClose().style.display = 'none';
this.lastSearchValue = '';
this.Activate(false);
return;
}
// strip whitespaces
var searchValue = this.DOMSearchField().value.replace(/ +/g, "");
if (searchValue != this.lastSearchValue) // search value has changed
{
if (searchValue != "") // non-empty search
{
// set timer for search update
this.keyTimeout = setTimeout(this.name + '.Search()',
this.keyTimeoutLength);
}
else // empty search field
{
this.DOMPopupSearchResultsWindow().style.display = 'none';
this.DOMSearchClose().style.display = 'none';
this.lastSearchValue = '';
}
}
}
this.SelectItemCount = function(id)
{
var count=0;
var win=this.DOMSearchSelectWindow();
for (i=0;i<win.childNodes.length;i++)
{
var child = win.childNodes[i]; // get span within a
if (child.className=='SelectItem')
{
count++;
}
}
return count;
}
this.SelectItemSet = function(id)
{
var i,j=0;
var win=this.DOMSearchSelectWindow();
for (i=0;i<win.childNodes.length;i++)
{
var child = win.childNodes[i]; // get span within a
if (child.className=='SelectItem')
{
var node = child.firstChild;
if (j==id)
{
node.innerHTML='&#8226;';
}
else
{
node.innerHTML='&#160;';
}
j++;
}
}
}
// Called when an search filter selection is made.
// set item with index id as the active item
this.OnSelectItem = function(id)
{
this.searchIndex = id;
this.SelectItemSet(id);
var searchValue = this.DOMSearchField().value.replace(/ +/g, "");
if (searchValue!="" && this.searchActive) // something was found -> do a search
{
this.Search();
}
}
this.OnSearchSelectKey = function(evt)
{
var e = (evt) ? evt : window.event; // for IE
if (e.keyCode==40 && this.searchIndex<this.SelectItemCount()) // Down
{
this.searchIndex++;
this.OnSelectItem(this.searchIndex);
}
else if (e.keyCode==38 && this.searchIndex>0) // Up
{
this.searchIndex--;
this.OnSelectItem(this.searchIndex);
}
else if (e.keyCode==13 || e.keyCode==27)
{
this.OnSelectItem(this.searchIndex);
this.CloseSelectionWindow();
this.DOMSearchField().focus();
}
return false;
}
// --------- Actions
// Closes the results window.
this.CloseResultsWindow = function()
{
this.DOMPopupSearchResultsWindow().style.display = 'none';
this.DOMSearchClose().style.display = 'none';
this.Activate(false);
}
this.CloseSelectionWindow = function()
{
this.DOMSearchSelectWindow().style.display = 'none';
}
// Performs a search.
this.Search = function()
{
this.keyTimeout = 0;
// strip leading whitespace
var searchValue = this.DOMSearchField().value.replace(/^ +/, "");
var code = searchValue.toLowerCase().charCodeAt(0);
var idxChar = searchValue.substr(0, 1).toLowerCase();
if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) // surrogate pair
{
idxChar = searchValue.substr(0, 2);
}
var resultsPage;
var resultsPageWithSearch;
var hasResultsPage;
var idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar);
if (idx!=-1)
{
var hexCode=idx.toString(16);
resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html';
resultsPageWithSearch = resultsPage+'?'+escape(searchValue);
hasResultsPage = true;
}
else // nothing available for this search term
{
resultsPage = this.resultsPath + '/nomatches.html';
resultsPageWithSearch = resultsPage;
hasResultsPage = false;
}
window.frames.MSearchResults.location = resultsPageWithSearch;
var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow();
if (domPopupSearchResultsWindow.style.display!='block')
{
var domSearchBox = this.DOMSearchBox();
this.DOMSearchClose().style.display = 'inline';
if (this.insideFrame)
{
var domPopupSearchResults = this.DOMPopupSearchResults();
domPopupSearchResultsWindow.style.position = 'relative';
domPopupSearchResultsWindow.style.display = 'block';
var width = document.body.clientWidth - 8; // the -8 is for IE :-(
domPopupSearchResultsWindow.style.width = width + 'px';
domPopupSearchResults.style.width = width + 'px';
}
else
{
var domPopupSearchResults = this.DOMPopupSearchResults();
var left = getXPos(domSearchBox) + 150; // domSearchBox.offsetWidth;
var top = getYPos(domSearchBox) + 20; // domSearchBox.offsetHeight + 1;
domPopupSearchResultsWindow.style.display = 'block';
left -= domPopupSearchResults.offsetWidth;
domPopupSearchResultsWindow.style.top = top + 'px';
domPopupSearchResultsWindow.style.left = left + 'px';
}
}
this.lastSearchValue = searchValue;
this.lastResultsPage = resultsPage;
}
// -------- Activation Functions
// Activates or deactivates the search panel, resetting things to
// their default values if necessary.
this.Activate = function(isActive)
{
if (isActive || // open it
this.DOMPopupSearchResultsWindow().style.display == 'block'
)
{
this.DOMSearchBox().className = 'MSearchBoxActive';
var searchField = this.DOMSearchField();
if (searchField.value == this.searchLabel) // clear "Search" term upon entry
{
searchField.value = '';
this.searchActive = true;
}
}
else if (!isActive) // directly remove the panel
{
this.DOMSearchBox().className = 'MSearchBoxInactive';
this.DOMSearchField().value = this.searchLabel;
this.searchActive = false;
this.lastSearchValue = ''
this.lastResultsPage = '';
}
}
}
// -----------------------------------------------------------------------
// The class that handles everything on the search results page.
function SearchResults(name)
{
// The number of matches from the last run of <Search()>.
this.lastMatchCount = 0;
this.lastKey = 0;
this.repeatOn = false;
// Toggles the visibility of the passed element ID.
this.FindChildElement = function(id)
{
var parentElement = document.getElementById(id);
var element = parentElement.firstChild;
while (element && element!=parentElement)
{
if (element.nodeName == 'DIV' && element.className == 'SRChildren')
{
return element;
}
if (element.nodeName == 'DIV' && element.hasChildNodes())
{
element = element.firstChild;
}
else if (element.nextSibling)
{
element = element.nextSibling;
}
else
{
do
{
element = element.parentNode;
}
while (element && element!=parentElement && !element.nextSibling);
if (element && element!=parentElement)
{
element = element.nextSibling;
}
}
}
}
this.Toggle = function(id)
{
var element = this.FindChildElement(id);
if (element)
{
if (element.style.display == 'block')
{
element.style.display = 'none';
}
else
{
element.style.display = 'block';
}
}
}
// Searches for the passed string. If there is no parameter,
// it takes it from the URL query.
//
// Always returns true, since other documents may try to call it
// and that may or may not be possible.
this.Search = function(search)
{
if (!search) // get search word from URL
{
search = window.location.search;
search = search.substring(1); // Remove the leading '?'
search = unescape(search);
}
search = search.replace(/^ +/, ""); // strip leading spaces
search = search.replace(/ +$/, ""); // strip trailing spaces
search = search.toLowerCase();
search = convertToId(search);
var resultRows = document.getElementsByTagName("div");
var matches = 0;
var i = 0;
while (i < resultRows.length)
{
var row = resultRows.item(i);
if (row.className == "SRResult")
{
var rowMatchName = row.id.toLowerCase();
rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_'
if (search.length<=rowMatchName.length &&
rowMatchName.substr(0, search.length)==search)
{
row.style.display = 'block';
matches++;
}
else
{
row.style.display = 'none';
}
}
i++;
}
document.getElementById("Searching").style.display='none';
if (matches == 0) // no results
{
document.getElementById("NoMatches").style.display='block';
}
else // at least one result
{
document.getElementById("NoMatches").style.display='none';
}
this.lastMatchCount = matches;
return true;
}
// return the first item with index index or higher that is visible
this.NavNext = function(index)
{
var focusItem;
while (1)
{
var focusName = 'Item'+index;
focusItem = document.getElementById(focusName);
if (focusItem && focusItem.parentNode.parentNode.style.display=='block')
{
break;
}
else if (!focusItem) // last element
{
break;
}
focusItem=null;
index++;
}
return focusItem;
}
this.NavPrev = function(index)
{
var focusItem;
while (1)
{
var focusName = 'Item'+index;
focusItem = document.getElementById(focusName);
if (focusItem && focusItem.parentNode.parentNode.style.display=='block')
{
break;
}
else if (!focusItem) // last element
{
break;
}
focusItem=null;
index--;
}
return focusItem;
}
this.ProcessKeys = function(e)
{
if (e.type == "keydown")
{
this.repeatOn = false;
this.lastKey = e.keyCode;
}
else if (e.type == "keypress")
{
if (!this.repeatOn)
{
if (this.lastKey) this.repeatOn = true;
return false; // ignore first keypress after keydown
}
}
else if (e.type == "keyup")
{
this.lastKey = 0;
this.repeatOn = false;
}
return this.lastKey!=0;
}
this.Nav = function(evt,itemIndex)
{
var e = (evt) ? evt : window.event; // for IE
if (e.keyCode==13) return true;
if (!this.ProcessKeys(e)) return false;
if (this.lastKey==38) // Up
{
var newIndex = itemIndex-1;
var focusItem = this.NavPrev(newIndex);
if (focusItem)
{
var child = this.FindChildElement(focusItem.parentNode.parentNode.id);
if (child && child.style.display == 'block') // children visible
{
var n=0;
var tmpElem;
while (1) // search for last child
{
tmpElem = document.getElementById('Item'+newIndex+'_c'+n);
if (tmpElem)
{
focusItem = tmpElem;
}
else // found it!
{
break;
}
n++;
}
}
}
if (focusItem)
{
focusItem.focus();
}
else // return focus to search field
{
parent.document.getElementById("MSearchField").focus();
}
}
else if (this.lastKey==40) // Down
{
var newIndex = itemIndex+1;
var focusItem;
var item = document.getElementById('Item'+itemIndex);
var elem = this.FindChildElement(item.parentNode.parentNode.id);
if (elem && elem.style.display == 'block') // children visible
{
focusItem = document.getElementById('Item'+itemIndex+'_c0');
}
if (!focusItem) focusItem = this.NavNext(newIndex);
if (focusItem) focusItem.focus();
}
else if (this.lastKey==39) // Right
{
var item = document.getElementById('Item'+itemIndex);
var elem = this.FindChildElement(item.parentNode.parentNode.id);
if (elem) elem.style.display = 'block';
}
else if (this.lastKey==37) // Left
{
var item = document.getElementById('Item'+itemIndex);
var elem = this.FindChildElement(item.parentNode.parentNode.id);
if (elem) elem.style.display = 'none';
}
else if (this.lastKey==27) // Escape
{
parent.searchBox.CloseResultsWindow();
parent.document.getElementById("MSearchField").focus();
}
else if (this.lastKey==13) // Enter
{
return true;
}
return false;
}
this.NavChild = function(evt,itemIndex,childIndex)
{
var e = (evt) ? evt : window.event; // for IE
if (e.keyCode==13) return true;
if (!this.ProcessKeys(e)) return false;
if (this.lastKey==38) // Up
{
if (childIndex>0)
{
var newIndex = childIndex-1;
document.getElementById('Item'+itemIndex+'_c'+newIndex).focus();
}
else // already at first child, jump to parent
{
document.getElementById('Item'+itemIndex).focus();
}
}
else if (this.lastKey==40) // Down
{
var newIndex = childIndex+1;
var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex);
if (!elem) // last child, jump to parent next parent
{
elem = this.NavNext(itemIndex+1);
}
if (elem)
{
elem.focus();
}
}
else if (this.lastKey==27) // Escape
{
parent.searchBox.CloseResultsWindow();
parent.document.getElementById("MSearchField").focus();
}
else if (this.lastKey==13) // Enter
{
return true;
}
return false;
}
}
function setKeyActions(elem,action)
{
elem.setAttribute('onkeydown',action);
elem.setAttribute('onkeypress',action);
elem.setAttribute('onkeyup',action);
}
function setClassAttr(elem,attr)
{
elem.setAttribute('class',attr);
elem.setAttribute('className',attr);
}
function createResults()
{
var results = document.getElementById("SRResults");
for (var e=0; e<searchData.length; e++)
{
var id = searchData[e][0];
var srResult = document.createElement('div');
srResult.setAttribute('id','SR_'+id);
setClassAttr(srResult,'SRResult');
var srEntry = document.createElement('div');
setClassAttr(srEntry,'SREntry');
var srLink = document.createElement('a');
srLink.setAttribute('id','Item'+e);
setKeyActions(srLink,'return searchResults.Nav(event,'+e+')');
setClassAttr(srLink,'SRSymbol');
srLink.innerHTML = searchData[e][1][0];
srEntry.appendChild(srLink);
if (searchData[e][1].length==2) // single result
{
srLink.setAttribute('href',searchData[e][1][1][0]);
if (searchData[e][1][1][1])
{
srLink.setAttribute('target','_parent');
}
var srScope = document.createElement('span');
setClassAttr(srScope,'SRScope');
srScope.innerHTML = searchData[e][1][1][2];
srEntry.appendChild(srScope);
}
else // multiple results
{
srLink.setAttribute('href','javascript:searchResults.Toggle("SR_'+id+'")');
var srChildren = document.createElement('div');
setClassAttr(srChildren,'SRChildren');
for (var c=0; c<searchData[e][1].length-1; c++)
{
var srChild = document.createElement('a');
srChild.setAttribute('id','Item'+e+'_c'+c);
setKeyActions(srChild,'return searchResults.NavChild(event,'+e+','+c+')');
setClassAttr(srChild,'SRScope');
srChild.setAttribute('href',searchData[e][1][c+1][0]);
if (searchData[e][1][c+1][1])
{
srChild.setAttribute('target','_parent');
}
srChild.innerHTML = searchData[e][1][c+1][2];
srChildren.appendChild(srChild);
}
srEntry.appendChild(srChildren);
}
srResult.appendChild(srEntry);
results.appendChild(srResult);
}
}
function init_search()
{
var results = document.getElementById("MSearchSelectWindow");
for (var key in indexSectionLabels)
{
var link = document.createElement('a');
link.setAttribute('class','SelectItem');
link.setAttribute('onclick','searchBox.OnSelectItem('+key+')');
link.href='javascript:void(0)';
link.innerHTML='<span class="SelectionMark">&#160;</span>'+indexSectionLabels[key];
results.appendChild(link);
}
searchBox.OnSelectItem(0);
}
/* @license-end */

BIN
html/search/search_l.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 567 B

BIN
html/search/search_m.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 158 B

BIN
html/search/search_r.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 553 B

18
html/search/searchdata.js Normal file
View file

@ -0,0 +1,18 @@
var indexSectionsWithContent =
{
0: "m",
1: "m"
};
var indexSectionNames =
{
0: "all",
1: "files"
};
var indexSectionLabels =
{
0: "All",
1: "Files"
};

BIN
html/splitbar.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 314 B

BIN
html/sync_off.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 853 B

BIN
html/sync_on.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 845 B

BIN
html/tab_a.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 142 B

BIN
html/tab_b.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 169 B

BIN
html/tab_h.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 177 B

BIN
html/tab_s.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 184 B

1
html/tabs.css Normal file
View file

File diff suppressed because one or more lines are too long