File: num.h

package info (click to toggle)
codequery 1.0.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 17,860 kB
  • sloc: cpp: 151,420; xml: 16,576; python: 5,602; ansic: 5,487; makefile: 559; perl: 496; ruby: 209; sql: 194; sh: 106; php: 53; vhdl: 51; erlang: 47; objc: 22; lisp: 18; cobol: 18; modula3: 17; asm: 14; fortran: 12; ml: 11; tcl: 6
file content (501 lines) | stat: -rw-r--r-- 13,782 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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
/**
 * @file: num.h 
 * Interface and implementation of numeration functionality.
 *
 * @defgroup Nums Numeration of objects
 *
 * @ingroup GraphBase
 * Numerations can be used to assign numbers to objects.
 *
 * @par
 * In application to graphs a numeration is a mapping of graph's nodes and/or edges to 
 * numbers. A node or an edge can be assigned a number in several different numerations. So
 * when we number them we say what numeration we are dealing with. Numeration class describes
 * one particular numeration. It is used as a parameter for functions like Numbered::number()
 * or Numbered::setNumber()
 *
 * @par
 * Usage model is following. To make an object numerable you derive it from Numbered class.
 * Then if you have some class representing a container for this objects you derive it from
 * the NumManager class. When you want to numerate objects derived from Numbered you ask
 * NumManager-derived object for a new numeration using NumManager::newNum(). Then use
 * Numbered::setNumber() and Numbered::number() to number objects and retrieve object number.
 * When you done with using numbers free the numeration by calling NumManager::freeNum().
 *@code
 //Derive your class from Numbered
 class Obj: public Numbered
 {
 pubic:
     void someAction();
     ...
 }
 //Derive class that controls Obj's instances from NumManager
 class ObjManager: public NumManager
 {
     // QList from Qt's containers
     QList<Obj *> objs;
  
     //Required reimplementation
     void clearNumerationsInObjects()
     {
         // Qt's macros for accessing each object in a container
         foreach ( Obj *obj, objs)
         {
             clearUnusedNumerations( obj);
         }
     }
 public: 
    Obj *newObj(){...}
    QList<Obj *> getObjects(){...};
 }
 //Usage
 void func()
 {
     ObjManager man;
     Numeration num = man.newNum(); // Acquire numeration
     for ( unsigned int i = 0; i < 100; i++)
     {
         Obj* obj = man.newObj();
         obj->setNumber( num, i % 2); // Assign number to object
     }
     foreach ( Obj *obj, man.getObjects())
     {
         if ( obj->number( num)) // Get object's number
            obj->someAction();
     }
     man.freeNum( num); // Free numeration
 }
 @endcode
 * You can have not more than MAX_NUMERATIONS at one time so if you forget to 
 * free a numeration you'll run into exception telling you that there are no free numeration
 * indices left.
 *
 * @sa Mark
 */
/*
 * Graph library, internal representation of graphs in ShowGraph tool.
 * Copyright (c) 2009, Boris Shurygin
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
 * 
 * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
/**
 * Numeration index type
 * @ingroup Nums
 */
typedef unsigned short int NumIndex;
/**
 * Numeration value type
 * @ingroup Nums
 */
typedef unsigned int NumValue;

/**
 * Possible num errors
 *
 * @ingroup Nums
 */
enum NumErrorType
{
    /** Some error occured */
    NUM_ERROR_GENERIC,
    /** We've ran out of indexes. Someone forgot to free nums? */
    NUM_ERROR_OUT_OF_INDEXES,
    /** We're out of values. Seems to be interanl error of num class.*/
    NUM_ERROR_OUT_OF_VALUES,
    /** Number is too big */
    NUM_ERROR_NUMBER_OUT_OF_RANGE,
    /** Number of error types */
    NUM_ERROR_NUM
};

/* Num-related constants */
/** 
 * Number of numerations allowed simultaneously  
 * @ingroup Nums
 */
const short int MAX_NUMERATIONS = 10;
/** 
 * Clean value
 * @ingroup Nums
 */
const NumValue NUM_VAL_CLEAN = 0;
/** 
 * First value
 * @ingroup Nums
 */
const NumValue NUM_VAL_FIRST = 1;
/**
 * Last value
 * @ingroup Nums
 */
const NumValue NUM_VAL_LAST = ( NumValue)( (int)-1);
/**
 *
 * Value that means object is unnumbered
 * @ingroup Nums
 */
const GraphNum NUMBER_NO_NUM = ( GraphNum) -1;
/**
 * Maximal number of object
 * @ingroup Nums
 */
const GraphNum NUMBER_MAX = (( GraphNum) -1) - 1;

/**
 * @class Numeration
 * @ingroup Nums
 * @brief Numeration description. 
 *
 * @par
 * In application to graphs a numeration is a mapping of graph's nodes and/or edges to 
 * numbers. A node or an edge can be assigned a number in several different numerations. So
 * when we number them we say what numeration we are dealing with. Numeration class describes
 * one particular numeration. It is used as a parameter for functions like Numbered::number()
 * or Numbered::setNumber(). 
 *
 * @par Some Implemetation Details
 * Numeration is created by NumManager class which ensures that numeration's index is used 
 * for this particular numeration only and gives it new value. Value field is used for 
 * comparison in routines like Numbered::isNumbered(). Value in numeration is compared to value
 * stored in @ref Numbered "numbered" object in array position pointed by numeration's index.
 * 
 * @sa Nums
 */
class Numeration
{
public:
    /** Default constructor */
    inline Numeration();
private:
    
    /** Nums index */
    NumIndex index;
    /** Value */
    NumValue value;

    /* Two classes have acces to num internals. All others do not. */
    friend class Numbered;
    friend class NumManager;
};

/** Default constructor */
inline Numeration::Numeration():
    index( MAX_NUMERATIONS), value( NUM_VAL_CLEAN)
{

}

/**
 * @class Numbered
 * @brief Represents an object that can be involved in several numerations
 *
 * @ingroup Nums
 * 
 * To assign numbers to objects you often have to incorporate it into object's implementation or 
 * make some sort of mapping of objects to numbers. The Numbered class can store several numbers
 * simultaneously so it can be member of several numerations at the same time. Being a part of
 * numeration an object can be: numbered or unnumbered. Object becomes numbered when a number is
 * given to it. Until then object is unnumbered. It is also possible to wipe the number from object
 * by calling unNumber(). Most routines have the @ref Numeration "numeration" parameter. It 
 * describes numeration of interest and is obtained from a @ref NumManager "numeration manager".
 */
class Numbered
{
public:
    /** Constructor */
    Numbered();

    /** Assign a number to object. Return false if object is already numbered. True otherwise. */
    inline bool setNumber( Numeration num, GraphNum new_number);
    
    /** Return number in given numeration or NO_NUM if it was not numbered yet */
    inline GraphNum number( Numeration num);
    
    /** Return true if node is numbered in this numeration */
    inline bool isNumbered( Numeration num);
    
    /** Return true if node has been numbered in this numeration and unmarks it */
    inline bool unNumber( Numeration num);
    
    /** Clears value for given index */
    inline void clear( NumIndex i);
private:
    /** Numeration descriptions */
    NumValue nums[ MAX_NUMERATIONS];

    /** Number in each numeration */
    GraphNum numbers[ MAX_NUMERATIONS];
};

/** Constructor */
inline Numbered::Numbered()
{
    NumIndex i;

    /** Initialize nums */
    for ( i = 0; i < MAX_NUMERATIONS; i++)
    {
        nums [ i] = NUM_VAL_CLEAN;
    }
}

/**
 * Assign a number to object. Return false if object is already numbered. True otherwise.
 */
inline bool 
Numbered::setNumber( Numeration num,
                     GraphNum new_number)
{
    if ( new_number >= NUMBER_MAX)
        throw NUM_ERROR_NUMBER_OUT_OF_RANGE;

    nums[ num.index] = num.value;
    numbers[ num.index] = new_number;
    if ( nums[ num.index] == num.value)
    {
        return false;
    }
    return true;
}

/**
 * Return number in given numeration or NO_NUM if it was not numbered yet
 */
inline GraphNum 
Numbered::number( Numeration num)
{
    if ( nums[ num.index] == num.value)
    {
        return numbers[ num.index];
    }
    return NUMBER_NO_NUM;
}

/**
 * Return true if node is numbered in this numeration
 */
inline bool 
Numbered::isNumbered( Numeration num)
{
    if ( nums[ num.index] == num.value)
    {
        return true;
    }
    return false;
}

/**
 * Return true if node has been numbered in this numeration and unmarks it
 */
inline bool 
Numbered::unNumber( Numeration num)
{
    if ( nums[ num.index] == num.value)
    {
        nums[ num.index] = NUM_VAL_CLEAN;
        return true;
    }
    return false;
}
    
/**
 * Clears value for given index
 */
inline void 
Numbered::clear( NumIndex i)
{
       nums[ i] = NUM_VAL_CLEAN;
}

/**
 * @brief Class that creates/frees numerations
 * @ingroup Nums
 *
 * @par
 * @ref NumManager "Numeration manager" creates and frees numerations. You can have up to MAX_NUMERATIONS numerations
 * at a time. A derived class should reimplement clearNumerationsInObjects() routine which calls clearUnusedNumerations
 * for every Numbered-derived object.
 */
class NumManager
{
public:

    /** Default Constructor */
    NumManager();
    
    /**
     * @brief Create new numeration
     * 
     * Create new numeration. Numerations MUST be freed after use,
     * otherwise you run to numerations number limit.
     */
    Numeration newNum();

    /** Free num */
    void freeNum( Numeration n);
protected:
    /** Clears unused markers in given object */
    inline void clearUnusedNumerations( Numbered *n_obj);
private:
    /** Marker values for each numeration */
    NumValue nums[ MAX_NUMERATIONS];
    /** Usage flags for each numeration index */
    bool is_used[ MAX_NUMERATIONS];
    /** Last used value */
    NumValue last;

    /** Find free index */
    inline NumIndex findFreeIndex();
    
    /** Increment num value */
    inline NumValue nextValue();
 
    /** Check if this value is busy */
    inline bool isValueBusy( NumValue val);

    /**
     * @brief Wipe values and indices that are not in use from numbered objects
     *
     * Clear info in objects. MUST BE implemented in inhereted class.
     * Implementation should call clearUnusedNumerations() for every object that can be numbered
     */
    virtual void clearNumerationsInObjects() = 0;

    /** Return next free value */
    inline NumValue findNextFreeValue();
};

/** Implementatinal routines */
/**
 * Find free index
 */
inline NumIndex NumManager::findFreeIndex()
{
    NumIndex i = 0;
    /** Search for free num index */
    for ( i = 0; i < MAX_NUMERATIONS; i++)
    {
        if ( !is_used [ i])
        {
            return i;
        }
    }
    throw NUM_ERROR_OUT_OF_INDEXES;
    return i;
}

/**
 * Increment num value
 */
inline NumValue NumManager::nextValue()
{
    if ( last == NUM_VAL_LAST)
    {
        last = NUM_VAL_FIRST;
    } else
    {
        last++;
    }
    return last;
}

/**
 * Check if this value is busy
 */
inline bool NumManager::isValueBusy( NumValue val)
{
    /** Check all nums */
    for ( NumIndex i = 0; i < MAX_NUMERATIONS; i++)
    {
        if ( is_used [ i] && nums[ i] == val)
            return true;
    }
    return false;
}

/**
 * Return next free value
 */
inline NumValue NumManager::findNextFreeValue()
{
    NumIndex i = 0;
    bool reached_limit = false;
    NumValue res = last;
    
    while( isValueBusy( res))
    {
        /** 
         * If we reached checked NUM_VAL_LAST twice,
         * then we are in infinite loop because for 
         * some reason we don't free our numerations
         */
        if ( res == NUM_VAL_LAST)
        {
            /*assert< NumErrorType> ( !reached_limit, 
                                       NUM_ERROR_OUT_OF_VALUES);*/
            clearNumerationsInObjects();
            reached_limit = true;            
        }
        res = nextValue();
    }
    return res;
}

/**
 * Clears unused markers in given object
 */
inline void NumManager::clearUnusedNumerations( Numbered *n_obj)
{
    for ( NumIndex i = 0; i < MAX_NUMERATIONS; i++)
    {
        if ( !is_used [ i])
            n_obj->clear( i);
    }
}

/**
 * Default Constructor
 */
inline NumManager::NumManager()
{
    NumIndex i;

    /** Initialize nums */
    for ( i = 0; i < MAX_NUMERATIONS; i++)
    {
        nums [ i] = NUM_VAL_CLEAN;
        is_used [ i] = false;
    }
    last = NUM_VAL_FIRST;
}

/**
 * Create new numeration
 */
inline Numeration NumManager::newNum()
{
    Numeration new_num;
        
    new_num.index = findFreeIndex();
    is_used[ new_num.index] = true;
    new_num.value = findNextFreeValue();
    nums[ new_num.index] = new_num.value;
    return new_num;
}

/**
 * Free num
 */
inline void NumManager::freeNum( Numeration n)
{
    is_used[ n.index] = false;
}