… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #ifndef OBJECT_H |
25 | #ifndef OBJECT_H |
… | |
… | |
436 | { |
437 | { |
437 | open_container (0); |
438 | open_container (0); |
438 | } |
439 | } |
439 | |
440 | |
440 | MTH object *force_find (shstr_tmp name); |
441 | MTH object *force_find (shstr_tmp name); |
|
|
442 | MTH void force_set_timer (int duration); |
441 | MTH object *force_add (shstr_tmp name, int duration = 0); |
443 | MTH object *force_add (shstr_tmp name, int duration = 0); |
442 | |
444 | |
443 | oblinkpt *find_link () const; |
445 | oblinkpt *find_link () const; |
444 | MTH void add_link (maptile *map, shstr_tmp id); |
446 | MTH void add_link (maptile *map, shstr_tmp id); |
445 | MTH void remove_link (); |
447 | MTH void remove_link (); |
… | |
… | |
491 | return (uint64)total_weight () |
493 | return (uint64)total_weight () |
492 | * 1000 |
494 | * 1000 |
493 | * (type == CONTAINER ? 1000 : 1) |
495 | * (type == CONTAINER ? 1000 : 1) |
494 | / dominant_material ()->density; |
496 | / dominant_material ()->density; |
495 | } |
497 | } |
|
|
498 | |
|
|
499 | MTH bool is_arch () const { return this == (const object *)(const archetype *)arch; } |
496 | |
500 | |
497 | MTH bool is_wiz () const { return flag [FLAG_WIZ]; } |
501 | MTH bool is_wiz () const { return flag [FLAG_WIZ]; } |
498 | MTH bool is_weapon () const { return type == ARROW || type == BOW || type == WEAPON; } |
502 | MTH bool is_weapon () const { return type == ARROW || type == BOW || type == WEAPON; } |
499 | MTH bool is_armor () const { return type == ARMOUR || type == SHIELD || type == HELMET |
503 | MTH bool is_armor () const { return type == ARMOUR || type == SHIELD || type == HELMET |
500 | || type == CLOAK || type == BOOTS || type == GLOVES |
504 | || type == CLOAK || type == BOOTS || type == GLOVES |
… | |
… | |
519 | /* This return true if object has still randomitems which |
523 | /* This return true if object has still randomitems which |
520 | * could be expanded. |
524 | * could be expanded. |
521 | */ |
525 | */ |
522 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
526 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
523 | |
527 | |
524 | MTH bool has_dialogue () const { return *&msg == '@'; } |
528 | static bool msg_has_dialogue (const char *msg) { return *msg == '@'; } |
|
|
529 | |
|
|
530 | MTH bool has_dialogue () const { return msg_has_dialogue (&msg); } |
525 | |
531 | |
526 | // returns the outermost owner, never returns 0 |
532 | // returns the outermost owner, never returns 0 |
527 | MTH object *outer_owner () |
533 | MTH object *outer_owner () |
528 | { |
534 | { |
529 | object *op; |
535 | object *op; |
… | |
… | |
533 | |
539 | |
534 | return op; |
540 | return op; |
535 | } |
541 | } |
536 | |
542 | |
537 | // returns the outermost environment, never returns 0 |
543 | // returns the outermost environment, never returns 0 |
538 | MTH object *outer_env () const |
544 | MTH object *outer_env_or_self () const |
539 | { |
545 | { |
540 | const object *op; |
546 | const object *op; |
541 | |
547 | |
542 | for (op = this; op->env; op = op->env) |
548 | for (op = this; op->env; op = op->env) |
543 | ; |
549 | ; |
544 | |
550 | |
545 | return const_cast<object *>(op); |
551 | return const_cast<object *>(op); |
|
|
552 | } |
|
|
553 | |
|
|
554 | // returns the outermost environment, may return 0 |
|
|
555 | MTH object *outer_env () const |
|
|
556 | { |
|
|
557 | return env ? outer_env_or_self () : 0; |
546 | } |
558 | } |
547 | |
559 | |
548 | // returns the player that has this object in his inventory, or 0 |
560 | // returns the player that has this object in his inventory, or 0 |
549 | // we assume the player is always the outer env |
561 | // we assume the player is always the outer env |
550 | MTH object *in_player () const |
562 | MTH object *in_player () const |
551 | { |
563 | { |
552 | object *op = outer_env (); |
564 | object *op = outer_env_or_self (); |
553 | |
565 | |
554 | return op->type == PLAYER ? op : 0; |
566 | return op->type == PLAYER ? op : 0; |
555 | } |
567 | } |
556 | |
568 | |
557 | // "temporary" helper function |
569 | // "temporary" helper function |
… | |
… | |
591 | } |
603 | } |
592 | |
604 | |
593 | // returns the player that cna see this object, if any |
605 | // returns the player that cna see this object, if any |
594 | MTH object *visible_to () const; |
606 | MTH object *visible_to () const; |
595 | |
607 | |
596 | MTH std::string long_desc (object *who = 0); |
608 | MTH std::string long_desc (object *who = 0); // query_name . " " . describe |
597 | MTH std::string describe_monster (object *who = 0); |
609 | MTH std::string describe_monster (object *who = 0); |
598 | MTH std::string describe_item (object *who = 0); |
610 | MTH std::string describe_item (object *who = 0); |
599 | MTH std::string describe (object *who = 0); |
611 | MTH std::string describe (object *who = 0); // long description, without name |
600 | |
612 | |
601 | MTH const char *query_weight () { return ::query_weight (this); } |
613 | MTH const char *query_weight () { return ::query_weight (this); } |
602 | MTH const char *query_name () { return ::query_name (this); } |
614 | MTH const char *query_name () { return ::query_name (this); } |
603 | MTH const char *query_short_name () { return ::query_short_name (this); } |
615 | MTH const char *query_short_name () { return ::query_short_name (this); } |
604 | MTH const char *query_base_name (bool plural) { return ::query_base_name (this, plural); } |
616 | MTH const char *query_base_name (bool plural) { return ::query_base_name (this, plural); } |
… | |
… | |
699 | // currently only used for players to make them temporarily visible |
711 | // currently only used for players to make them temporarily visible |
700 | // when they are invisible. |
712 | // when they are invisible. |
701 | MTH void make_noise (); |
713 | MTH void make_noise (); |
702 | |
714 | |
703 | /* animation */ |
715 | /* animation */ |
704 | bool has_anim () { return animation_id; } |
716 | MTH bool has_anim () const { return animation_id; } |
705 | const animation &anim () const { return animations [animation_id]; } |
717 | const animation &anim () const { return animations [animation_id]; } |
706 | faceidx get_anim_frame (int frame) const { return anim ().faces [frame]; } |
718 | MTH faceidx get_anim_frame (int frame) const { return anim ().faces [frame]; } |
707 | void set_anim_frame (int frame) { face = get_anim_frame (frame); } |
719 | MTH void set_anim_frame (int frame) { face = get_anim_frame (frame); } |
708 | /* anim_frames () returns the number of animations allocated. The last |
720 | /* anim_frames () returns the number of animations allocated. The last |
709 | * usuable animation will be anim_frames () - 1 (for example, if an object |
721 | * usuable animation will be anim_frames () - 1 (for example, if an object |
710 | * has 8 animations, anim_frames () will return 8, but the values will |
722 | * has 8 animations, anim_frames () will return 8, but the values will |
711 | * range from 0 through 7. |
723 | * range from 0 through 7. |
712 | */ |
724 | */ |
713 | int anim_frames () const { return anim ().num_animations; } |
725 | MTH int anim_frames () const { return anim ().num_animations; } |
714 | int anim_facings () const { return anim ().facings; } |
726 | MTH int anim_facings () const { return anim ().facings; } |
|
|
727 | |
|
|
728 | MTH char *as_string (); |
715 | |
729 | |
716 | protected: |
730 | protected: |
717 | void link (); |
731 | void link (); |
718 | void unlink (); |
732 | void unlink (); |
719 | |
733 | |
… | |
… | |
728 | // move this object to the top of its env's inventory to speed up |
742 | // move this object to the top of its env's inventory to speed up |
729 | // searches for it. |
743 | // searches for it. |
730 | static object * |
744 | static object * |
731 | splay (object *ob) |
745 | splay (object *ob) |
732 | { |
746 | { |
733 | if (ob->env && ob->env->inv != ob) |
747 | if (ob->above && ob->env) |
734 | { |
748 | { |
735 | if (ob->above) ob->above->below = ob->below; |
749 | if (ob->above) ob->above->below = ob->below; |
736 | if (ob->below) ob->below->above = ob->above; |
750 | if (ob->below) ob->below->above = ob->above; |
737 | |
751 | |
738 | ob->above = 0; |
752 | ob->above = 0; |