2012-01-16 11:12:38 +01:00
|
|
|
/*
|
|
|
|
* This file is a part of Winix
|
2014-10-04 20:04:03 +02:00
|
|
|
* and is distributed under the 2-Clause BSD licence.
|
|
|
|
* Author: Tomasz Sowa <t.sowa@ttmath.org>
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2018-01-06 19:12:53 +01:00
|
|
|
* Copyright (c) 2012-2018, Tomasz Sowa
|
2012-01-16 11:12:38 +01:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
2014-10-04 20:04:03 +02:00
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
2012-01-16 11:12:38 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "templates.h"
|
|
|
|
|
2014-02-12 17:30:49 +01:00
|
|
|
namespace Winix
|
|
|
|
{
|
|
|
|
|
2012-01-16 11:12:38 +01:00
|
|
|
namespace TemplatesFunctions
|
|
|
|
{
|
|
|
|
|
|
|
|
|
2016-03-22 15:53:43 +01:00
|
|
|
|
|
|
|
|
2014-10-28 20:14:46 +01:00
|
|
|
bool are_spaces_the_same(const std::vector<Ezc::Var> & params, const std::vector<std::wstring> & spaces)
|
2012-01-16 11:12:38 +01:00
|
|
|
{
|
|
|
|
// last value from params is the parameter name (not a space)
|
|
|
|
if( spaces.size() + 1 != params.size() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for(size_t i=0 ; i<spaces.size() ; ++i)
|
2014-10-28 20:14:46 +01:00
|
|
|
if( spaces[i] != params[i].str )
|
2012-01-16 11:12:38 +01:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-10-28 20:14:46 +01:00
|
|
|
void copy_space(const std::vector<Ezc::Var> & params, std::vector<std::wstring> & spaces)
|
2012-01-16 11:12:38 +01:00
|
|
|
{
|
|
|
|
if( !params.empty() )
|
|
|
|
{
|
|
|
|
spaces.resize(params.size() - 1);
|
|
|
|
|
|
|
|
for(size_t i=0 ; i<params.size() - 1 ; ++i)
|
2014-10-28 20:14:46 +01:00
|
|
|
spaces[i] = params[i].str;
|
2012-01-16 11:12:38 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
spaces.clear();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-10-28 20:14:46 +01:00
|
|
|
PT::Space * find_space(const std::vector<Ezc::Var> & params, PT::Space & space, size_t level = 0)
|
2012-01-16 11:12:38 +01:00
|
|
|
{
|
|
|
|
if( level + 1 < params.size() )
|
|
|
|
{
|
|
|
|
for(size_t i=0 ; i<space.spaces.size() ; ++i)
|
|
|
|
{
|
2014-10-28 20:14:46 +01:00
|
|
|
if( space.spaces[i]->name == params[level].str )
|
2012-01-16 11:12:38 +01:00
|
|
|
return find_space(params, *space.spaces[i], level+1);
|
|
|
|
}
|
|
|
|
|
|
|
|
// there is no such a space
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return &space;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-03-22 15:53:43 +01:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* IMPROVE ME
|
|
|
|
* add a private namespace?
|
|
|
|
*
|
|
|
|
*/
|
2012-01-16 11:12:38 +01:00
|
|
|
struct SpaceInfo
|
|
|
|
{
|
|
|
|
bool inited;
|
|
|
|
PT::Space * last_space;
|
|
|
|
std::vector<std::wstring> spaces;
|
|
|
|
|
|
|
|
SpaceInfo()
|
|
|
|
{
|
|
|
|
inited = false;
|
|
|
|
last_space = 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
static std::map<PT::Space*, SpaceInfo> spaces_map;
|
|
|
|
static size_t space_reqid = 0;
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-03-22 15:53:43 +01:00
|
|
|
|
|
|
|
|
2014-10-28 20:14:46 +01:00
|
|
|
void space_init(const std::vector<Ezc::Var> & params, PT::Space & space, SpaceInfo & space_info)
|
2012-01-16 11:12:38 +01:00
|
|
|
{
|
|
|
|
if( !space_info.inited || !are_spaces_the_same(params, space_info.spaces) )
|
|
|
|
{
|
|
|
|
space_info.inited = true;
|
|
|
|
copy_space(params, space_info.spaces);
|
|
|
|
space_info.last_space = find_space(params, space);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void space_check_reqid()
|
|
|
|
{
|
|
|
|
if( space_reqid != cur->request->id )
|
|
|
|
{
|
|
|
|
space_reqid = cur->request->id;
|
|
|
|
spaces_map.clear();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-03-22 15:53:43 +01:00
|
|
|
void space_value(Info & i, PT::Space & space, bool escape)
|
2012-01-16 11:12:38 +01:00
|
|
|
{
|
|
|
|
space_check_reqid();
|
|
|
|
|
|
|
|
if( !i.params.empty() )
|
|
|
|
{
|
|
|
|
SpaceInfo & space_info = spaces_map[&space];
|
|
|
|
space_init(i.params, space, space_info);
|
|
|
|
|
|
|
|
if( space_info.last_space )
|
|
|
|
{
|
2014-10-28 20:14:46 +01:00
|
|
|
const std::wstring & param = i.params.back().str;
|
2018-01-06 19:12:53 +01:00
|
|
|
const std::wstring * value = space_info.last_space->GetFirstValue(param);
|
2012-01-16 11:12:38 +01:00
|
|
|
|
|
|
|
if( value )
|
2016-03-22 15:53:43 +01:00
|
|
|
{
|
|
|
|
if( escape )
|
|
|
|
i.out << *value;
|
|
|
|
else
|
|
|
|
i.out << R(*value);
|
|
|
|
}
|
2012-01-16 11:12:38 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-06-05 23:31:12 +02:00
|
|
|
|
|
|
|
|
2012-01-16 11:12:38 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
2016-04-04 18:02:36 +02:00
|
|
|
struct SpaceTabStackItem : public Ezc::FunData
|
2012-01-16 11:12:38 +01:00
|
|
|
{
|
|
|
|
std::vector<std::wstring> values;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-03-22 15:53:43 +01:00
|
|
|
void space_list_tab(Info & i, PT::Space & space)
|
2016-03-23 16:20:42 +01:00
|
|
|
{
|
|
|
|
if( !i.stack.fun_data )
|
|
|
|
{
|
|
|
|
if( !i.params.empty() )
|
|
|
|
{
|
2016-04-04 18:02:36 +02:00
|
|
|
SpaceTabStackItem * stack_item = new SpaceTabStackItem();
|
2016-03-23 16:20:42 +01:00
|
|
|
i.stack.fun_data = stack_item;
|
|
|
|
|
|
|
|
PT::Space * dst_space = find_space(i.params, space);
|
|
|
|
|
|
|
|
if( dst_space )
|
|
|
|
dst_space->ListText(i.params.back().str, stack_item->values);
|
|
|
|
|
|
|
|
i.res = i.iter < stack_item->values.size();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2016-04-04 18:02:36 +02:00
|
|
|
auto stack_item = reinterpret_cast<SpaceTabStackItem*>(i.stack.fun_data);
|
2016-03-23 16:20:42 +01:00
|
|
|
i.res = i.iter < stack_item->values.size();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2016-04-04 18:02:36 +02:00
|
|
|
void space_list_tab_value(Info & i, PT::Space & space, const std::wstring & function_name)
|
2016-03-23 16:20:42 +01:00
|
|
|
{
|
2016-04-04 18:02:36 +02:00
|
|
|
Ezc::Stack * stack;
|
|
|
|
auto user_object = i.FindUserObject<SpaceTabStackItem>(function_name, &stack);
|
2016-03-23 16:20:42 +01:00
|
|
|
|
2016-04-04 18:02:36 +02:00
|
|
|
if( user_object && stack->iter < user_object->values.size() )
|
|
|
|
i.out << user_object->values[stack->iter];
|
2016-03-23 16:20:42 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-04-04 18:02:36 +02:00
|
|
|
void space_list_tab_has_next(Info & i, PT::Space & space, const std::wstring & function_name)
|
|
|
|
{
|
|
|
|
Ezc::Stack * stack;
|
|
|
|
auto user_object = i.FindUserObject<SpaceTabStackItem>(function_name, &stack);
|
|
|
|
|
|
|
|
if( user_object && stack->iter + 1 < user_object->values.size() )
|
|
|
|
i.res = true;
|
|
|
|
|
|
|
|
}
|
2016-03-23 16:20:42 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
2012-01-16 11:12:38 +01:00
|
|
|
} // namespace TemplatesFunctions
|
|
|
|
|
2014-02-12 17:30:49 +01:00
|
|
|
} // namespace Winix
|
|
|
|
|
2012-01-16 11:12:38 +01:00
|
|
|
|
|
|
|
|