Ports Search

Results 961970 of 17,754 for %E6%8E%A7%E5%88%B6%E5%8F%B0.(0.027 seconds)
www/HTML-QuickCheck-1.0b1 (Score: 0.005674402)
Simple and fast HTML syntax checking package for perl 4 and perl 5
The objective of the package is to provide a fast and essential HTML check (esp. for CGI scripts where response time is important) to prevent a piece of user input HTML code from messing up the rest of a file, i.e., to minimize and localize any possible damage created by including a piece of user input HTML text in a dynamic document. HTMLQuickCheck checks for unmatched < and >, unmatched tags and improper nesting, which could ruin the rest of the document. Attributes and elements with optional end tags are not checked, as they should not cause disasters with any decent browsers (they should ignore any unrecognized tags and attributes according to the standard). A piece of HTML that passes HTMLQuickCheck may not necessarily be valid HTML, but it would be very unlikely to screw others but itself. A valid piece of HTML that doesn't pass the HTMLQuickCheck is however very likely to screw many browsers(which are obviously broken in terms of strict conformance). HTMLQuickCheck currently supports HTML 1.0, 2.x (draft), 3.0 (draft) and netscape extensions (1.1).
devel/fc++-1.5 (Score: 0.005648984)
Functional Programming in C++
FC++ is a library for functional programming in C++. Functional programming is a programming paradigm in which functions are treated as regular values. Thus, we can have functions that take other functions as parameters. The former functions are called "higher-order" functions. A common feature of functions is that they can be polymorphic. "Polymorphic" means that the same function can be used with arguments of many types. FC++ is distinguished from other libraries (including the C++ Standard Library) by its complete support for polymorphism: FC++ polymorphic higher-order functions can take other polymorphic functions as arguments and return polymorphic functions as results. This is particularly useful (i.e., simplifies code) in C++ where type inference is limited and we often need to pass polymorphic functions around and determine their type later. With FC++ you can define your own higher-order polymorphic functions, but the library also contains a large amount of functionality that can be re-used as-is in C++ programs. This includes infinite ("lazy") lists, useful higher-order functions (like map, compose, etc.), a reference-counting facility that can be used to replace C++ pointers, many common logical and arithmetic operators in a form that can be used with higher-order functions, and more.
emulators/qemu-2.6.90.g20160728 (Score: 0.005648984)
QEMU CPU Emulator github bsd-user branch - static user targets
QEMU is a FAST! processor emulator using dynamic translation to achieve good emulation speed. QEMU has two operating modes: * Full system emulation. In this mode, QEMU emulates a full system (for example a PC), including a processor and various peripherials. It can be used to launch different Operating Systems without rebooting the PC or to debug system code. * User mode emulation (Linux host only). In this mode, QEMU can launch Linux processes compiled for one CPU on another CPU. It can be used to launch the Wine Windows API emulator or to ease cross-compilation and cross-debugging. As QEMU requires no host kernel patches to run, it is very safe and easy to use. This is a slave port of emulators/qemu-sbruno to build only static bsd-user targets named like qemu-mips-static. While still being experimental people have already built quite a few armv6/mips/mips64 packages using these and e.g. poudriere. Some notes are also here: http://wiki.freebsd.org/QemuUserModeHowTo
math/openfst-1.5.4 (Score: 0.005648984)
Library for working with weighted finite-state transducers (FSTs)
OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar finite-state acceptor is represented as a transducer with each transition's input and output label equal. Finite-state acceptors are used to represent sets of strings (specifically, regular or rational sets); finite-state transducers are used to represent binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition. FSTs have key applications in speech recognition and synthesis, machine translation, optical character recognition, pattern matching, string processing, machine learning, information extraction and retrieval among others. Often a weighted transducer is used to represent a probabilistic model (e.g., an n-gram model, pronunciation model). FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
audio/mp3val-0.1.8 (Score: 0.0056213443)
Program for MPEG audio stream validation
MP3val is a small, high-speed, free software tool for checking MPEG audio files' integrity. It can be useful for finding corrupted files (e.g. incompletely downloaded, truncated, containing garbage). MP3val is also able to fix most of the problems. Being a multiplatform application, MP3val can be runned both under Windows and under Linux (or BSD). The most common MPEG audio file type is MPEG 1 Layer III (mp3), but MP3val supports also other MPEG versions and layers. The tool is also aware of the most common types of tags (ID3v1, ID3v2, APEv2). The core component of MP3val is an application with command-line interface. There are also two graphical frontends for it: MP3val-frontend is a native Windows application (it is also included in the latest binary releases for Windows), mp3valgui is a multi-platform Python script (can be downloaded separately), written by an independent developer. Installing the latter under Windows is a bit tricky, so for Windows the first frontend is recommended.
games/legends-0.4.1.43 (Score: 0.0056213443)
Fast-paced first-person-perspective online multiplayer game
Legends is a fast-paced first-person-perspective online multiplayer game released as freeware (software license). The game is designed to take advantage of the beautiful environments available from the Torque engine it is based on, while still offering the breakneck pacing and variety of styles available from such classics as Quake and Tribes. Gameplay is not the strafe-strafe-jump-strafe-shoot-strafe-run-like-hell style a lot of games espouse; the addition of a jetpack adds a third dimension of mobility that makes skill, forethought, and restraint necessities to winning. Team sizes are ideal between 10 and 15 on each side, and the network code allows 56k upwards to play smoothly. Game type offerings range from the classic Capture the Flag, Deathmatch and Duel to our own new types, e.g.. 'War'. Plenty of maps are provided by us, but the beauty of this game is its customization possibilities. Mission creation has never been easier, with a stable, full-featured editor integrated into the game engine itself. Skins, models, and effects can all be modified by the end-user with commonly available tools. The game has an Autodownload feature which means you never have to leave the game to join new user created Client-Side and Server-Side missions.
sysutils/uniutils-2.27 (Score: 0.0056213443)
Unicode Description Utilities
Uniutils consists of five programs for finding out what is in a Unicode file. They are useful when working with Unicode files when one doesn't know the writing system, doesn't have the necessary font, needs to inspect invisible characters, needs to find out whether characters have been combined or in what order they occur, or needs statistics on which characters occur. uniname defaults to printing the character offset of each character, its byte offset, its hex code value, its encoding, the glyph itself, and its name. unidesc reports the character ranges to which different portions of the text belong. It can also be used to identify Unicode encodings (e.g. UTF-16be) flagged by magic numbers. unihist generates a histogram of the characters in its input, which must be encoded in UTF-8 Unicode. ExplicateUTF8 is intended for debugging or for learning about Unicode. It determines and explains the validity of a sequence of bytes as a UTF8 encoding. Unirev is a filter that reverses UTF-8 strings character-by-character (as opposed to byte-by-byte).
databases/MySQLdb-1.2.5 (Score: 0.00561776)
Access a MySQL database through Python
Python interface to MySQL MySQLdb is an interface to the popular MySQL database server for Python. The design goals are: - Compliance with Python database API version 2.0 - Thread-safety - Thread-friendliness (threads will not block each other) - Compatibility with MySQL-3.22 and later This module should be mostly compatible with an older interface written by Joe Skinner and others. However, the older version is a) not thread-friendly, b) written for MySQL 3.21, c) apparently not actively maintained. No code from that version is used in MySQLdb. MySQLdb is free software.
sysutils/wtail-0.2.2 (Score: 0.0056057684)
Wtail does the equivalent of tail -f on several files at once
wtail does the equivalent of tail -f on several files at once. The screen is split into as many parts as there are files to watch.
benchmarks/bonnie-2.0.6 (Score: 0.005590771)
Performance Test of Filesystem I/O
Bonnie: Filesystem Benchmark Program Bonnie tests the speed of file I/O using standard C library calls. It does reads and writes of blocks, testing for the limit of sustained data rate (usually limited by the drive or controller) and updates on a file (better simulating normal operating conditions and quite dependent on drive and OS optimisations). The per-character read and write tests are generally limited by CPU speed only on current-generation hardware. It takes some 35 SPECint92 to read or write a file at a rate of 1MB/s using getc() and putc(). The seek tests are dependent on the buffer cache size, since the fraction of disk blocks that fits into the buffer cache will be found without any disk operation and will contribute zero seek time readings. I.e. if the buffer cache is 16MB and the Bonnie test file is 32MB in size, then the seek time will come out as half its real value. The seek time includes rotational delay, and will thus always come out higher than specified for a drive.