-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.c
111 lines (89 loc) · 2.43 KB
/
list.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
/*
beatfreq - FFT-based Beat frequency calculator
Copyright (C) 2003-2010 Nigel D. Stepp
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.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
This program is DUAL LICENSED under the MIT License, which means you may
choose the license terms appropriate for your use. See COPYING-GPL and
COPYING-MIT for details.
Nigel Stepp <[email protected]>
$Id: list.c 613 2010-08-25 17:40:47Z stepp $
*/
#include <stdio.h>
#include <stdlib.h>
#include "global.h"
#include "list.h"
/*
* Simple function to add a node on the end of a linked list
*/
maxima_list_t *add_maximum(maxima_list_t *list,int index, data_t intensity)
{
maxima_list_t *new_max,*p=list;
new_max = malloc(sizeof(maxima_list_t));
new_max->index = index;
new_max->intensity = intensity;
new_max->next = NULL;
if(!p) {
return(new_max);
} else {
while(p->next) {
p = p->next;
}
p->next = new_max;
return(list);
}
return(NULL);
}
/*
* This adds a node to a linked list such that it maintains ordering
*/
maxima_list_t *add_maximum_sort(maxima_list_t *list,int index, data_t intensity)
{
maxima_list_t *new_max,*p=list;
new_max = malloc(sizeof(maxima_list_t));
new_max->index = index;
new_max->intensity = intensity;
new_max->next = NULL;
if(!list) {
return(new_max);
} else {
if(new_max->intensity > p->intensity) {
new_max->next = p;
return(new_max);
} else {
while(p->next) {
if(new_max->intensity > p->next->intensity) {
new_max->next = p->next;
p->next = new_max;
return(list);
}
p=p->next;
}
p->next=new_max;
return(list);
}
}
return(NULL);
}
/*
* Free a generic list
*/
void free_list(generic_list_t *list)
{
generic_list_t *p=list;
generic_list_t *pnext;
while (p) {
pnext = p->next;
free(p);
p = pnext;
}
}