/** @file */
/***********************************************

 !!!! DO NOT EDIT THIS FILE !!!!

 All content has been auto-generated by 
 the boilerplater.pl utility.

 See boilerplater's documentation for details.

 ***********************************************/



#ifndef R_KINO_SORTEDHITQUEUE
#define R_KINO_SORTEDHITQUEUE 1

#include "KinoSearch/Search/SortedHitQueue.h"

#define KINO_SORTEDHITQUEUE_BOILERPLATE



#define Kino_SortedHitQ_Clone(self) \
    (self)->_->clone((kino_Obj*)self)

#define Kino_SortedHitQ_Destroy(self) \
    (self)->_->destroy((kino_Obj*)self)

#define Kino_SortedHitQ_Equals(self, other) \
    (self)->_->equals((kino_Obj*)self, other)

#define Kino_SortedHitQ_Hash_Code(self) \
    (self)->_->hash_code((kino_Obj*)self)

#define Kino_SortedHitQ_Is_A(self, target_vtable) \
    (self)->_->is_a((kino_Obj*)self, target_vtable)

#define Kino_SortedHitQ_To_String(self) \
    (self)->_->to_string((kino_Obj*)self)

#define Kino_SortedHitQ_Serialize(self, target) \
    (self)->_->serialize((kino_Obj*)self, target)

#define Kino_SortedHitQ_Insert(self, element) \
    (self)->_->insert((kino_PriorityQueue*)self, element)

#define Kino_SortedHitQ_Pop(self) \
    kino_PriQ_pop((kino_PriorityQueue*)self)

#define Kino_SortedHitQ_Peek(self) \
    kino_PriQ_peek((kino_PriorityQueue*)self)

struct KINO_SORTEDHITQUEUE_VTABLE {
    KINO_OBJ_VTABLE *_;
    chy_u32_t refcount;
    KINO_OBJ_VTABLE *parent;
    const char *class_name;
    kino_Obj_clone_t clone;
    kino_Obj_destroy_t destroy;
    kino_Obj_equals_t equals;
    kino_Obj_hash_code_t hash_code;
    kino_Obj_is_a_t is_a;
    kino_Obj_to_string_t to_string;
    kino_Obj_serialize_t serialize;
    kino_PriQ_insert_t insert;
    kino_PriQ_pop_t pop;
    kino_PriQ_peek_t peek;
};

extern KINO_SORTEDHITQUEUE_VTABLE KINO_SORTEDHITQUEUE;

#ifdef KINO_USE_SHORT_NAMES
  #define SortedHitQueue kino_SortedHitQueue
  #define SORTEDHITQUEUE KINO_SORTEDHITQUEUE
  #define SortedHitQ_new kino_SortedHitQ_new
  #define SortedHitQ_Clone Kino_SortedHitQ_Clone
  #define SortedHitQ_Destroy Kino_SortedHitQ_Destroy
  #define SortedHitQ_Equals Kino_SortedHitQ_Equals
  #define SortedHitQ_Hash_Code Kino_SortedHitQ_Hash_Code
  #define SortedHitQ_Is_A Kino_SortedHitQ_Is_A
  #define SortedHitQ_To_String Kino_SortedHitQ_To_String
  #define SortedHitQ_Serialize Kino_SortedHitQ_Serialize
  #define SortedHitQ_Insert Kino_SortedHitQ_Insert
  #define SortedHitQ_Pop Kino_SortedHitQ_Pop
  #define SortedHitQ_Peek Kino_SortedHitQ_Peek
#endif /* KINO_USE_SHORT_NAMES */

#define KINO_SORTEDHITQUEUE_MEMBER_VARS \
    chy_u32_t  refcount; \
    chy_u32_t  size; \
    chy_u32_t  max_size; \
    void ** heap; \
    kino_Obj_less_than_t  less_than; \
    kino_Obj_free_elem_t  free_elem

#ifdef KINO_WANT_SORTEDHITQUEUE_VTABLE
KINO_SORTEDHITQUEUE_VTABLE KINO_SORTEDHITQUEUE = {
    (KINO_OBJ_VTABLE*)&KINO_VIRTUALTABLE,
    1,
    (KINO_OBJ_VTABLE*)&KINO_HITQUEUE,
    "KinoSearch::Search::SortedHitQueue",
    (kino_Obj_clone_t)kino_Obj_clone,
    (kino_Obj_destroy_t)kino_PriQ_destroy,
    (kino_Obj_equals_t)kino_Obj_equals,
    (kino_Obj_hash_code_t)kino_Obj_hash_code,
    (kino_Obj_is_a_t)kino_Obj_is_a,
    (kino_Obj_to_string_t)kino_Obj_to_string,
    (kino_Obj_serialize_t)kino_Obj_serialize,
    (kino_PriQ_insert_t)kino_PriQ_insert,
    (kino_PriQ_pop_t)kino_PriQ_pop,
    (kino_PriQ_peek_t)kino_PriQ_peek
};
#endif /* KINO_WANT_SORTEDHITQUEUE_VTABLE */

#undef KINO_SORTEDHITQUEUE_BOILERPLATE


#endif /* R_KINO_SORTEDHITQUEUE */


/* Copyright 2007 Marvin Humphrey
 *
 * This program is free software; you can redistribute it and/or modify
 * under the same terms as Perl itself.
 */