File: run_count.m

package info (click to toggle)
octave 2.0.16-2
  • links: PTS
  • area: main
  • in suites: potato
  • size: 26,276 kB
  • ctags: 16,450
  • sloc: cpp: 67,548; fortran: 41,514; ansic: 26,682; sh: 7,361; makefile: 4,077; lex: 2,008; yacc: 1,849; lisp: 1,702; perl: 1,676; exp: 123
file content (57 lines) | stat: -rw-r--r-- 1,417 bytes parent folder | download | duplicates (8)
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
## Copyright (C) 1995, 1996, 1997  Friedrich Leisch
## 
## 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, 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 file.  If not, write to the Free Software Foundation,
## 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

## usage:  run_count (x, n)
##
## Counts the upward runs in the columns of x of length 1, 2, ... n-1
## and >= n.

## Author:  FL <Friedrich.Leisch@ci.tuwien.ac.at>
## Description:  Count upward runs

function retval = run_count (x, n)
  
  [xr, xc] = size(x);
  
  tmp = zeros (xr,xc);
  retval = zeros (n, xc);
  
  for j = 1 : xc
    run = 1;
    count = 1;

    for k = 2 : xr

      if x(k, j) < x(k-1, j)
	tmp(run, j) = count;
	run = run + 1;
	count = 0;
      endif
    
      count = count + 1;

    endfor

    tmp(run, j) = count;
  
  endfor
  
  for k=1 : (n-1)
    retval(k, :) = sum (tmp == k);
  endfor
  retval(n, :) = sum (tmp >= n);
  
endfunction