File: histogram_oper.c

package info (click to toggle)
ruby-gsl 2.1.0.3%2Bdfsg1-5
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 5,604 kB
  • sloc: ansic: 62,050; ruby: 15,845; sh: 19; makefile: 10
file content (150 lines) | stat: -rw-r--r-- 3,371 bytes parent folder | download | duplicates (5)
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
/* gsl_histogram_oper.c
 * Copyright (C) 2000  Simone Piccardi
 *
 * This library 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 library; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */
/***************************************************************
 *
 * File gsl_histogram_oper.c:
 * Routine to make operation on histograms.
 * Need GSL library and header.
 * Contains the routines:
 * gsl_histogram_same_binning check if two histograms have the same binning
 * gsl_histogram_add          add two histograms
 * gsl_histogram_sub          subctract two histograms
 * gsl_histogram_mult         multiply two histograms
 * gsl_histogram_div          divide two histograms
 * gsl_histogram_scale        scale histogram contents
 *
 * Author: S. Piccardi
 * Jan. 2000
 *
 ***************************************************************/
#include <stdlib.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_math.h>
#include <gsl/gsl_histogram.h>

/*
 * gsl_histogram_same_binning:
 * control if two histograms have the
 * same binning
 */

int
mygsl_histogram_equal_bins_p (const gsl_histogram * h1, const gsl_histogram * h2)
{
  if (h1->n != h2->n)
  {
    return 0;
  }
  {
    size_t i;
    /* init ranges */

    for (i = 0; i <= h1->n; i++)
    {
      if (gsl_fcmp(h1->range[i],h2->range[i], 1e-12))
      {
        return 0;
      }
    }
  }

  return 1;
}

/*
 * gsl_histogram_add:
 * add two histograms
 */
int
mygsl_histogram_add (gsl_histogram * h1, const gsl_histogram * h2)
{
  size_t i;

  if (!mygsl_histogram_equal_bins_p (h1, h2))
  {
    GSL_ERROR ("histograms have different binning", GSL_EINVAL);
  }
  for (i = 0; i < h1->n; i++)
  {
    h1->bin[i] += h2->bin[i];
  }
  return GSL_SUCCESS;
}

/*
 * gsl_histogram_sub:
 * subtract two histograms
 */

int
mygsl_histogram_sub (gsl_histogram * h1, const gsl_histogram * h2)
{
  size_t i;

  if (!mygsl_histogram_equal_bins_p (h1, h2))
  {
    GSL_ERROR ("histograms have different binning", GSL_EINVAL);
  }
  for (i = 0; i < h1->n; i++)
  {
    h1->bin[i] -= h2->bin[i];
  }
  return GSL_SUCCESS;

}

/*
 * gsl_histogram_mult:
 * multiply two histograms
 */

int
mygsl_histogram_mul (gsl_histogram * h1, const gsl_histogram * h2)
{
  size_t i;

  if (!mygsl_histogram_equal_bins_p (h1, h2))
  {
    GSL_ERROR ("histograms have different binning", GSL_EINVAL);
  }
  for (i = 0; i < h1->n; i++)
  {
    h1->bin[i] *= h2->bin[i];
  }
  return GSL_SUCCESS;
}
/*
 * gsl_histogram_div:
 * divide two histograms
 */
int
mygsl_histogram_div (gsl_histogram * h1, const gsl_histogram * h2)
{
  size_t i;

  if (!mygsl_histogram_equal_bins_p (h1, h2))
  {
    GSL_ERROR ("histograms have different binning", GSL_EINVAL);
  }
  for (i = 0; i < h1->n; i++)
  {
    h1->bin[i] /= h2->bin[i];
  }
  return GSL_SUCCESS;
}