mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 02:49:02 -04:00
Moves the source files into the src/ dir.
This commit is contained in:
parent
ec9cdeac61
commit
a7bc628bc3
98 changed files with 454 additions and 421 deletions
|
|
@ -1,43 +0,0 @@
|
|||
/*
|
||||
* Copyright (C) 2013 Andrea Mazzoleni
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
#ifndef __RAID_HELPER_H
|
||||
#define __RAID_HELPER_H
|
||||
|
||||
/**
|
||||
* Inserts an integer in a sorted vector.
|
||||
*
|
||||
* This function can be used to insert indexes in order, ready to be used for
|
||||
* calling raid_rec().
|
||||
*
|
||||
* @n Number of integers currently in the vector.
|
||||
* @v Vector of integers already sorted.
|
||||
* It must have extra space for the new elemet at the end.
|
||||
* @i Value to insert.
|
||||
*/
|
||||
void raid_insert(int n, int *v, int i);
|
||||
|
||||
/**
|
||||
* Sorts a small vector of integers.
|
||||
*
|
||||
* If you have indexes not in order, you can use this function to sort them
|
||||
* before calling raid_rec().
|
||||
*
|
||||
* @n Number of integers. No more than RAID_PARITY_MAX.
|
||||
* @v Vector of integers.
|
||||
*/
|
||||
void raid_sort(int n, int *v);
|
||||
|
||||
#endif
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue