File: predictorbase.hpp

package info (click to toggle)
libjpeg 0.0~git20241105.c719010-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 3,904 kB
  • sloc: cpp: 36,434; makefile: 618; ansic: 275; sh: 54; python: 39; perl: 11
file content (151 lines) | stat: -rw-r--r-- 5,360 bytes parent folder | download | duplicates (3)
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
151
/*************************************************************************

    This project implements a complete(!) JPEG (Recommendation ITU-T
    T.81 | ISO/IEC 10918-1) codec, plus a library that can be used to
    encode and decode JPEG streams. 
    It also implements ISO/IEC 18477 aka JPEG XT which is an extension
    towards intermediate, high-dynamic-range lossy and lossless coding
    of JPEG. In specific, it supports ISO/IEC 18477-3/-6/-7/-8 encoding.

    Note that only Profiles C and D of ISO/IEC 18477-7 are supported
    here. Check the JPEG XT reference software for a full implementation
    of ISO/IEC 18477-7.

    Copyright (C) 2012-2018 Thomas Richter, University of Stuttgart and
    Accusoft. (C) 2019-2020 Thomas Richter, Fraunhofer IIS.

    This program is available under two licenses, GPLv3 and the ITU
    Software licence Annex A Option 2, RAND conditions.

    For the full text of the GPU license option, see README.license.gpl.
    For the full text of the ITU license option, see README.license.itu.
    
    You may freely select between these two options.

    For the GPL option, please note the following:

    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 3 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, see <http://www.gnu.org/licenses/>.

*************************************************************************/
/*
**
** This is the base class for all predictors, to be used for the
** lossless predictive mode. It performs the prediction, based
** on the mode, in a virtual subclass.
**
** $Id: predictorbase.hpp,v 1.3 2014/11/17 12:15:25 thor Exp $
**
*/

#ifndef CODESTREAM_PREDICTORBASE_HPP
#define CODESTREAM_PREDICTORBASE_HPP

/// Includes
#include "tools/environment.hpp"
#include "std/assert.hpp"
///

/// class PredictorBase
// This is the base class for all predictors, to be used for the
// lossless predictive mode. It performs the prediction, based
// on the mode, in a virtual subclass.
class PredictorBase : public JObject {
  //
public:
  //
  // Prediction directions
  enum PredictionMode {
    None     = 0,   // use zero as predicted value, only for differential modes.
    Left     = 1,   // predict from left
    Top      = 2,   // predict from above
    LeftTop  = 3,   // predict from left-top
    Linear   = 4,   // linear interpolation
    WeightA  = 5,   // linear interpolation with weight on A
    WeightB  = 6,   // linear interpolation with weight on B
    Diagonal = 7,   // diagonal interpolation, only A and B
    Neutral  = 8    // interpolation from neutral value.
  };
  //
#if ACCUSOFT_CODE 
  //
private:
  //
  // Predictors for the next sample to the right,
  // and for the next sample to the bottom.
  // These are part of the prediction state
  // machine that is advanced as soon as we move 
  // to one or the other direction.
  //
  // Next predictor to use when moved to the right.
  class PredictorBase *m_pNextRight;
  //
  // Next predictor to be used when moving down.
  class PredictorBase *m_pNextDown;
  //
  // Create a predictor of the given preshift and mode.
  template<PredictionMode mode>
  static PredictorBase *CreatePredictor(class Environ *env,UBYTE preshift,LONG neutral);
  //
  // Create a predictor of the given preshift and mode.
  static PredictorBase *CreatePredictor(class Environ *env,PredictionMode mode,UBYTE preshift,
                                              LONG neutral);
  //
protected:
  //
  PredictorBase(void)
  : m_pNextRight(NULL), m_pNextDown(NULL)
  { }
  //
public:
  //
  // Create a prediction chain for the given neutral value and
  // the given prediction mode. The mode "none" is used to
  // indicate the differential mode.
  // This requires an array of four predictors to be used for
  // life-time management. The first element is the initial predictor.
  static void CreatePredictorChain(class Environ *env,
                                   class PredictorBase *chain[4],PredictionMode mode,UBYTE preshift,
                                   LONG neutral);
  //
  virtual ~PredictorBase(void)
  { }
  //
  // Predict a sample value depending on the prediction mode.
  // lp is the pointer to the current line, pp the one to the previous line.
  // v is the decoded sample value.
  virtual LONG DecodeSample(LONG v,const LONG *lp,const LONG *pp) const = 0;
  //
  // This is the inverse, it creates the sample to encode from the
  // present samples.
  virtual LONG EncodeSample(const LONG *lp,const LONG *pp) const = 0;
  //
  // Return the next predictor when moving one sample to the right.
  class PredictorBase *MoveRight(void) const
  {
    assert(m_pNextRight);
    return m_pNextRight;
  }
  //
  // Return the next predictor when moving one samle down.
  class PredictorBase *MoveDown(void) const
  {
    assert(m_pNextDown);
    return m_pNextDown;
  }
#endif
};
///

///
#endif