To download this library for your Linux/Mac installation, enter this on your command line:
DreamDownload byond://Theodis.LanguageFilter##version=1
Emulator users, in the BYOND pager go to File | Open Location and enter this URL:
byond://Theodis.LanguageFilter##version=1
2252 downloads
Version 1
Date added: | Sep 29 2001 |
Last updated: | Jul 29 2009 |
0 fans
|
This isn't documented at all but the code is easy to read if you know BYOND. Anyway here's how to use it.
Before you use any of the libraries functions call InitFilter(). This initialized the CurseWords list and loads it up with the words in filter.dat(if you have one). Then to add a word to the list use AddWord() and to remove a word use RemoveWord(). If you want to save the word list use the SaveFilter() proc when the world is closed or whenever you want to save the list. The main proc is the FilterString() proc which goes through the string passed to it and replaces any words which match words in the CurseWords list with random symbols and then returns the resulting string.
|
|
Related Libraries
Change "115" into "One Hundred Fifteen"!
|
|
A text handling library to replace/supplement Deadron.TextHandling.
|
|
String manipulation functions
|
|
A very small library with no useful features, such as getting a list of fans from the hub; and retrieving your hub ID.
|
|
Contains 200,000+ words for quick and easy reference! A must for word games!
|
|
Helpful procs for using numbers in text
|
|
Simple plug-in library to add flexible nametags to your games!
|
|
Version 3. Last updated 1/10/04 12:28 AM
|
|
Converts number strings like 1e+006 to 1000000
|
|
A new Text library(better than the last one I made)
|
|
A library that allows you to check strings to see if they're either completely uppercase or lowercase.
|
|
Add quicklinks such as google:hello and id:23 to your game.
|
|
|
More Libraries by Theodis
An implementation of a quad tree data structure
|
|
A library for dividing a map into seperate regions based on accessibility.
|
|
A library for having customizable explosions
|
|
A list kept sorted by the contained item's ref value
|
|
A datum which uses the flood fill algorithm to find all connected nodes on a graph according to a supplied criteria
|
|
A library which sorts lists
|
|
A priority queue data structure built using a binary heap.
|
|
A library containing implementations of the A* and Dijkstra algorithms.
|
|
A library for generating intersting explosions
|
|
Copyright © 2025 BYOND Software.
All rights reserved.