Fix inexistent_top_provides_sunlight heuristic in make_block and remove clitch-causing optimization - minetest.git

diff options

author	Perttu Ahola <celeron55@gmail.com>	2012-01-27 14:54:42 +0200
committer	Perttu Ahola <celeron55@gmail.com>	2012-03-27 19:01:52 +0300
commit	a57f4c23d8fa490f2aef8bd2bc15d9d4e3a7dbd5 (patch)
tree	c2ae52c2e620f363832fdf46a21b4f8dc407cfd2 /po/fr
parent	d629f4d2fbb14476d19a5da55035efdeeacc3a42 (diff)
download	minetest-a57f4c23d8fa490f2aef8bd2bc15d9d4e3a7dbd5.tar.gz minetest-a57f4c23d8fa490f2aef8bd2bc15d9d4e3a7dbd5.tar.bz2 minetest-a57f4c23d8fa490f2aef8bd2bc15d9d4e3a7dbd5.zip

Fix inexistent_top_provides_sunlight heuristic in make_block and remove clitch-causing optimization

Diffstat (limited to 'po/fr')

0 files changed, 0 insertions, 0 deletions

/* Minetest-c55 Copyright (C) 2011 celeron55, Perttu Ahola <celeron55@gmail.com> 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 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include "tool.h" #include "utility.h" #include "itemdef.h" // For itemgroup_get() #include "log.h" #include "inventory.h" void ToolCapabilities::serialize(std::ostream &os) const { writeU8(os, 1); // version writeF1000(os, full_punch_interval); writeS16(os, max_drop_level); writeU32(os, groupcaps.size()); for(std::map<std::string, ToolGroupCap>::const_iterator i = groupcaps.begin(); i != groupcaps.end(); i++){ const std::string *name = &i->first; const ToolGroupCap *cap = &i->second; os<<serializeString(*name); writeS16(os, cap->uses); writeS16(os, cap->maxlevel); writeU32(os, cap->times.size()); for(std::map<int, float>::const_iterator i = cap->times.begin(); i != cap->times.end(); i++){ writeS16(os, i->first); writeF1000(os, i->second); } } } void ToolCapabilities::deSerialize(std::istream &is) { int version = readU8(is); if(version != 1) throw SerializationError( "unsupported ToolCapabilities version"); full_punch_interval = readF1000(is); max_drop_level = readS16(is); groupcaps.clear(); u32 groupcaps_size = readU32(is); for(u32 i=0; i<groupcaps_size; i++){ std::string name = deSerializeString(is); ToolGroupCap cap; cap.uses = readS16(is); cap.maxlevel = readS16(is); u32 times_size = readU32(is); for(u32 i=0; i<times_size; i++){ int level = readS16(is); float time = readF1000(is); cap.times[level] = time; } groupcaps[name] = cap; } } DigParams getDigParams(const ItemGroupList &groups, const ToolCapabilities *tp, float time_from_last_punch) { //infostream<<"getDigParams"<<std::endl; /* Check group dig_immediate */ switch(itemgroup_get(groups, "dig_immediate")){ case 2: //infostream<<"dig_immediate=2"<<std::endl; return DigParams(true, 0.5, 0, "dig_immediate"); case 3: //infostream<<"dig_immediate=3"<<std::endl; return DigParams(true, 0.0, 0, "dig_immediate"); default: break; } // Values to be returned (with a bit of conversion) bool result_diggable = false; float result_time = 0.0; float result_wear = 0.0; std::string result_main_group = ""; int level = itemgroup_get(groups, "level"); //infostream<<"level="<<level<<std::endl; for(std::map<std::string, ToolGroupCap>::const_iterator i = tp->groupcaps.begin(); i != tp->groupcaps.end(); i++){ const std::string &name = i->first; //infostream<<"group="<<name<<std::endl; const ToolGroupCap &cap = i->second; int rating = itemgroup_get(groups, name); float time = 0; bool time_exists = cap.getTime(rating, &time); if(!result_diggable || time < result_time){ if(cap.maxlevel >= level && time_exists){ result_diggable = true; int leveldiff = cap.maxlevel - level; result_time = time / MYMAX(1, leveldiff); if(cap.uses != 0) result_wear = 1.0 / cap.uses / pow(3.0, (double)leveldiff); else result_wear = 0; result_main_group = name; } } } //infostream<<"result_diggable="<<result_diggable<<std::endl; //infostream<<"result_time="<<result_time<<std::endl; //infostream<<"result_wear="<<result_wear<<std::endl; if(time_from_last_punch < tp->full_punch_interval){ float f = time_from_last_punch / tp->full_punch_interval; //infostream<<"f="<<f<<std::endl;


context:
space:
mode: