1 /****************************************************************************

     2 **

     3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).

     4 ** All rights reserved.

     5 ** Contact: Nokia Corporation (qt-info@nokia.com)

     6 **

     7 ** This file is part of the tools applications of the Qt Toolkit.

     8 **

     9 ** $QT_BEGIN_LICENSE:LGPL$

    10 ** No Commercial Usage

    11 ** This file contains pre-release code and may not be distributed.

    12 ** You may use this file in accordance with the terms and conditions

    13 ** contained in the Technology Preview License Agreement accompanying

    14 ** this package.

    15 **

    16 ** GNU Lesser General Public License Usage

    17 ** Alternatively, this file may be used under the terms of the GNU Lesser

    18 ** General Public License version 2.1 as published by the Free Software

    19 ** Foundation and appearing in the file LICENSE.LGPL included in the

    20 ** packaging of this file.  Please review the following information to

    21 ** ensure the GNU Lesser General Public License version 2.1 requirements

    22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.

    23 **

    24 ** In addition, as a special exception, Nokia gives you certain additional

    25 ** rights.  These rights are described in the Nokia Qt LGPL Exception

    26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.

    27 **

    28 ** If you have questions regarding the use of this file, please contact

    29 ** Nokia at qt-info@nokia.com.

    30 **

    31 **

    32 **

    33 **

    34 **

    35 **

    36 **

    37 **

    38 ** $QT_END_LICENSE$

    39 **

    40 ****************************************************************************/

    41 #include "codegenerator.h"

    42 #include <qdebug.h>

    43 namespace CodeGenerator

    44 {

    45 

    46 //Convenience constructor so you can say Item("foo")

    47 Item::Item(const char * const text) : generator(Text(QByteArray(text)).generator) {}

    48 

    49 int BaseGenerator::currentCount(GeneratorStack * const stack) const

    50 {

    51     const int stackSize = stack->count();

    52     for (int i = stackSize - 1; i >= 0; --i) {

    53         BaseGenerator const * const generator = stack->at(i);

    54         switch (generator->type) {

    55             case RepeaterType: {

    56                 RepeaterGenerator const * const repeater = static_cast<RepeaterGenerator const * const>(generator);

    57                 return repeater->currentRepeat;

    58             } break;

    59             case GroupType: {

    60                 GroupGenerator const * const group = static_cast<GroupGenerator const * const>(generator);

    61                 return group->currentRepeat;

    62             } break;

    63             default:

    64             break;

    65         }

    66     }

    67     return -1;

    68 }

    69 

    70 int BaseGenerator::repeatCount(GeneratorStack * const stack) const

    71 {

    72     const int stackSize = stack->count();

    73     for (int i = stackSize - 1; i >= 0; --i) {

    74         BaseGenerator const * const generator = stack->at(i);

    75         switch (generator->type) {

    76             case RepeaterType: {

    77                 RepeaterGenerator const * const repeater = static_cast<RepeaterGenerator const * const>(generator);

    78                 return repeater->currentRepeat;

    79             } break;

    80 /*            case GroupType: {

    81                 GroupGenerator const * const group = static_cast<GroupGenerator const * const>(generator);

    82                 return group->currentRepeat;

    83             } break;

    84 */  

    85             default:

    86             break;

    87         }

    88     }

    89     return -1;

    90 }

    91 

    92 QByteArray RepeaterGenerator::generate(GeneratorStack * const stack)

    93 { 

    94     GeneratorStacker stacker(stack, this);

    95     QByteArray generated;

    96     for (int i = repeatOffset; i < repeatCount + repeatOffset; ++i) {

    97         currentRepeat = i;

    98         generated += childGenerator->generate(stack);

    99     }

   100     return generated;

   101 };

   102 

   103 QByteArray GroupGenerator::generate(GeneratorStack * const stack)

   104 { 

   105     const int repeatCount = currentCount(stack);

   106     GeneratorStacker stacker(stack, this);

   107     QByteArray generated;

   108 

   109     if (repeatCount > 0)

   110         generated += prefix->generate(stack);

   111 

   112     for (int i = 1; i <= repeatCount; ++i) {

   113         currentRepeat = i;

   114         generated += childGenerator->generate(stack);

   115         if (i != repeatCount)

   116             generated += separator->generate(stack);

   117     }

   118 

   119     if (repeatCount > 0)

   120         generated += postfix->generate(stack);

   121 

   122     return generated;

   123 };

   124 

   125 const Compound operator+(const Item &a, const Item &b)

   126 {

   127     return Compound(a, b);

   128 }

   129 

   130 const Compound operator+(const Item &a, const char * const text)

   131 {

   132     return Compound(a, Text(text));

   133 }

   134 

   135 const Compound operator+(const char * const text, const Item &b)

   136 {

   137     return Compound(Text(text), b);    

   138 }

   139 

   140 }