labels.suggest_word_number=Количество слов
labels.suggest_word_type_all=Все
labels.suggest_word_type_document=Документ
labels.suggest_word_type_query=Запрос
labels.elevate_word_configuration=Elevate Word
labels.elevate_word_title_details=Elevate Word
labels.elevate_word_link_list=Список
labels.elevate_word_link_create=Создать новый
labels.elevate_word_link_edit=Редактировать
labels.elevate_word_link_delete=Удалить

page.request.header.max.fetch.size=1000
# Maximum number of scheduled job records to fetch per page.
page.scheduled.job.max.fetch.size=100
# Maximum number of elevate word records to fetch per page.
page.elevate.word.max.fetch.size=1000
# Maximum number of bad word records to fetch per page.
page.bad.word.max.fetch.size=1000
# Maximum number of dictionary records to fetch per page.

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to