Jump to content

alexghinet

Member
  • Content Count

    68
  • Joined

  • Last visited

  • Yangs

    259 [ Donate ]

Community Reputation

0 Neutral

About alexghinet

  • Rank
    Friendly

Informations

  • Gender
    Male

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. Hey do someone know what does that mean or how to fix that log? May 30 13:32:21 :: Handshake: lower than zero -21 May 30 13:32:22 :: Handshake: client_time 0 server_time 81049 P.s: May it crash server? Thanks in advance.
  2. H Hey , do someone have a function for Special storage (Stone inventory) to stone +0 +1 +2 can be read by Alchemist for Ore refine? i tryed so but doens't work: int pc_ore_refine(lua_State* L) { if (!lua_isnumber(L, 1)) { lua_pushboolean(L, 0); return 1; } int cost = (int) lua_tonumber(L, 1); int pct = (int)lua_tonumber(L, 2); int metinstone_cell = (int)lua_tonumber(L, 3); LPCHARACTER ch = CQuestManager::instance().GetCurrentCharacterPtr(); LPCHARACTER npc = CQuestManager::instance().GetCurrentNPCCharacterPtr(); LPITEM item = CQuestManager::instance().GetCurrentItem(); #ifdef ENABLE_SPECIAL_STORAGE LPITEM metinstone_item = ch->GetStoneInventoryItem(metinstone_cell); #else LPITEM metinstone_item = ch->GetInventoryItem(metinstone_cell); #endif if (item && metinstone_item) lua_pushboolean(L, mining::OreRefine(ch, npc, item, cost, pct, metinstone_item)); else lua_pushboolean(L, 0); return 1; }
  3. everything works but i just need a function to destroy items
  4. Version of Files : XXX Hello I installed sistem Special storage and i tryed to add "Destroy" button When i clik destroy , dialog dissapear but item doesn't get destroyed Do someone have a function or a fix for this? Thanks in advance!
  5. Okay , thanks ! mby .mde skins have troubbles. i mean in generaly What vs do u use?
  6. Is good but single problem is cause "?? ?? ??" Will appear afther some time
  7. i mean i fixxed that crash from items
  8. I get crash 20 by 20 minutes with 20 players online help please? #0 CHARACTER::GetName (this=0x29cd3ad0) at char.cpp:696 #1 0x0817ba0d in ITEM_MANAGER::GetDropPct (this=0xffffa65c, pkChr=0x2fec14e0, pkKiller=0x2fec14e0, iDeltaPercent=@0x3b1d6e60: 804000992, iRandRange=<error reading variable>) at item_manager.cpp:859 #2 0x0817dd7a in __DropEvent_RefineBox_GetDropItem (killer=..., victim=..., itemMgr=...) at item_manager.cpp:1457 #3 0x0828d9e3 in heartbeat (ht=0x29831b30, pulse=31242) at main.cpp:355 #4 0x0828db6e in heartbeat (ht=0xffffdb28, pulse=31242) at main.cpp:366 #5 0x0828f40b in main (argc=1, argv=0x0) at main.cpp:579 (gdb) bt full #0 CHARACTER::GetName (this=0x29cd3ad0) at char.cpp:696 No locals. #1 0x0817ba0d in ITEM_MANAGER::GetDropPct (this=0xffffa65c, pkChr=0x2fec14e0, pkKiller=0x2fec14e0, iDeltaPercent=@0x3b1d6e60: 804000992, iRand iLevel = <optimized out> bRank = <optimized out> #2 0x0817dd7a in __DropEvent_RefineBox_GetDropItem (killer=..., victim=..., itemMgr=...) at item_manager.cpp:1457 killer_level = <optimized out> lowerBox = {50197, 50198, 50199} midderBox = {50203, 50204, 50205, 50206} higherBox = {50207, 50208, 50209, 50210, 50211} #3 0x0828d9e3 in heartbeat (ht=0x29831b30, pulse=31242) at main.cpp:355 c_set_desc = <optimized out> t = 1248488 #4 0x0828db6e in heartbeat (ht=0xffffdb28, pulse=31242) at main.cpp:366 t = 4294944296 #5 0x0828f40b in main (argc=1, argv=0x0) at main.cpp:579 sectree_manager = {<singleton<SECTREE_MANAGER>> = {_vptr$singleton = 0x83dbfe8, static ms_singleton = 0x0}, static current_sectree_vers _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, SECTREE_MAP*> > >> = {<__gnu_cxx::new_allocator<std::fields>}, _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, _M_header = {_M_c _M_node_count = 6}}}, m_map_pkArea = {_M_t = { _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<int const, std::map<std::basic_string<char, std::char_traits<char>, std::llocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, TAreaInfo> > > > > >ing<char, std::char_traits<char>, std::allocator<char> >, TAreaInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<ctor<char> > const, TAreaInfo> > > > > >> = {<No data fields>}, <No data fields>}, _M_key_compare = {<std::binary_function<int, int, bool>> = {< _M_left = 0xffffa930, _M_right = 0xffffa930}, _M_node_count = 0}}}, m_vec_mapRegion = {<std::_Vector_base<SMapRegion, std::al _M_impl = {<std::allocator<SMapRegion>> = {<__gnu_cxx::new_allocator<SMapRegion>> = {<No data fields>}, <No data fields>}, _M_sta _M_end_of_storage = 0x3a64c300}}, <No data fields>}, m_mapNPCPosition = {_M_t = { _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, std::vector<npc_info, std::allocator<npc_info> > > > pc_info, std::allocator<npc_info> > > > >> = {<No data fields>}, <No data fields>}, _M_key_compare = {<std::binary_function<unsigned int, unsig _M_color = std::_S_red, _M_parent = 0x301a1380, _M_left = 0x2e050080, _M_right = 0x3285a740}, _M_node_count = 6}}}, next_private_index_map_ = {<std::tr1::_Hashtable<long, std::pair<long const, int>, std::allocator<std::pair<long const, int> >, std::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, std::tr1::__detail::_Prime_rehash_policy, false, false, true>> = {<std:ng, std::pair<long const, int>, std::allocator<std::pair<long const, int> >, std::_Select1st<std::pair<long const, int> >, std::equal_to<long>,nged_hash, std::tr1::__detail::_Prime_rehash_policy, false, false, true> >> = {<No data fields>}, <std::tr1::__detail::_Hash_code_base<long, sttd::tr1::hash<long>, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, false>> = {_M_extract = {<std::unary_fun _M_eq = {<std::binary_function<long, long, bool>> = {<No data fields>}, <No data fields>}, _M_h1 = {<std::unary_function<long, _M_h2 = {<No data fields>}}, <std::tr1::__detail::_Map_base<long, std::pair<long const, int>, std::_Select1st<std::pair<long copair<long const, int> >, std::_Select1st<std::pair<long const, int> >, std::equal_to<long>, std::tr1::hash<long>, std::tr1::__detail::_Mod_rang false, false, true> >> = {<No data fields>}, _M_node_allocator = {<__gnu_cxx::new_allocator<std::tr1::__detail::_Hash_node<std::pair<long cons _M_bucket_count = 11, _M_element_count = 0, _M_rehash_policy = {_M_max_load_factor = 1, _M_growth_factor = 2, _M_next_resize = 11 title = {<singleton<TitleManager>> = {_vptr$singleton = 0x83f8b50, static ms_singleton = 0x0}, <No data fields>} char_manager = {<singleton<CHARACTER_MANAGER>> = {_vptr$singleton = 0x83b9f18, static ms_singleton = 0x0}, m_iMobItemRate = 100, m_iMob m_iMobItemRatePremium = 100, m_iMobGoldAmountRatePremium = 100, m_iMobGoldDropRatePremium = 100, m_iMobExpRatePremium = 100, m_iUserD m_map_pkChrByVID = {<std::tr1::_Hashtable<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::allocator<std::pair<unsigned ual_to<unsigned int>, std::tr1::hash<unsigned int>, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, std::tr1:::tr1::__detail::_Prime_rehash_policy, std::tr1::_Hashtable<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::allocator<std::pair<u std::equal_to<unsigned int>, std::tr1::hash<unsigned int>, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, s1::__detail::_Hash_code_base<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::_Select1st<std::pair<unsigned int const, CHARACTER*>hashing, std::tr1::__detail::_Default_ranged_hash, false>> = {_M_extract = {<std::unary_function<std::pair<unsigned int const, CHARACTER*>, uns _M_eq = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, _M_h1 = {<std::unary _M_h2 = {<No data fields>}}, <std::tr1::__detail::_Map_base<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::_Seled::pair<unsigned int const, CHARACTER*>, std::allocator<std::pair<unsigned int const, CHARACTER*> >, std::_Select1st<std::pair<unsigned int conil::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, std::tr1::__detail::_Prime_rehash_policy, false, false, true> >> = {<No data _M_node_allocator = {<__gnu_cxx::new_allocator<std::tr1::__detail::_Hash_node<std::pair<unsigned int const, CHARACTER*>, false> > _M_element_count = 15432, _M_rehash_policy = {_M_max_load_factor = 1, _M_growth_factor = 2, _M_next_resize = 30727}}, <No data fi m_map_pkChrByPID = {<std::tr1::_Hashtable<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::allocator<std::pair<unsigned ual_to<unsigned int>, std::tr1::hash<unsigned int>, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, std::tr1:::tr1::__detail::_Prime_rehash_policy, std::tr1::_Hashtable<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::allocator<std::pair<u std::equal_to<unsigned int>, std::tr1::hash<unsigned int>, std::tr1::__detail::_Mod_range_hashing, std::tr1::__detail::_Default_ranged_hash, s1::__detail::_Hash_code_base<unsigned int, std::pair<unsigned int const, CHARACTER*>, std::_Select1st<std::pair<unsigned int const, CHARACTER*>hashing, std::tr1::__detail::_Default_ranged_hash, false>> = {_M_extract = {<std::unary_function<std::pair<unsigned int const, CHARACTER*>, uns _M_eq = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, _M_h1 = {<std::unary @Moț @WeedHex
×
×
  • Create New...

Important Information

Terms of Use / Privacy Policy / Guidelines / We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.