英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字,中文词皆可:

brail    
n. 卷帆索,抄网
vt. 用卷帆索卷,用抄网捞

卷帆索,抄网用卷帆索卷,用抄网捞

brail
n 1: a small net used to draw fish into a boat
2: a small rope (one of several) used to draw a sail in
v 1: take in a sail with a brail
2: haul fish aboard with brails

Plaice \Plaice\, n. [F. plaise, plais, prob. fr. L. platessa
flatish, plaice. See {Place}.] (Zool.)
(a) A European food fish ({Pleuronectes platessa}), allied to
the flounder, and growing to the weight of eight or ten
pounds or more.
(b) A large American flounder ({Paralichthys dentatus};
called also {brail}, {puckermouth}, and {summer
flounder}. The name is sometimes applied to other allied
species. [Written also {plaise}.]
[1913 Webster]

{Plaice mouth}, a mouth like that of a plaice; a small or wry
mouth. [R.] --B. Jonson.
[1913 Webster]


Brail \Brail\, v. t. (Naut.)
To haul up by the brails; -- used with up; as, to brail up a
sail.
[1913 Webster]


Brail \Brail\, n. [OE. brayle furling rope, OF. braiol a band
placed around the breeches, fr.F. braies, pl., breeches, fr.
L. braca, bracae, breeches, a Gallic word; cf. Arm. bragez.
Cf. {Breeches}.]
[1913 Webster]
1. (Falconry) A thong of soft leather to bind up a hawk's
wing.
[1913 Webster]

2. pl. (Naut.) Ropes passing through pulleys, and used to
haul in or up the leeches, bottoms, or corners of sails,
preparatory to furling.
[1913 Webster]

3. A stock at each end of a seine to keep it stretched.
[1913 Webster]


请选择你想看的字典辞典:
单词字典翻译
brail查看 brail 在百度字典中的解释百度英翻中〔查看〕
brail查看 brail 在Google字典中的解释Google英翻中〔查看〕
brail查看 brail 在Yahoo字典中的解释Yahoo英翻中〔查看〕





安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • LeetCode - The Worlds Leading Online Programming Learning Platform
    Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
  • Maximum Subarray - LeetCode
    Can you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1] has the largest sum 6 Example 2: Input: nums = [1] Output: 1 Explanation: The subarray [1] has the largest sum 1 Example 3: Input: nums = [5,4,-1
  • Longest Substring Without Repeating Characters - LeetCode
    Can you solve this real interview question? Longest Substring Without Repeating Characters - Given a string s, find the length of the longest substring without duplicate characters Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3 Note that "bca" and "cab" are also correct answers Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer
  • - LeetCode
    Can you solve this real interview question? - Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
  • Merge k Sorted Lists - LeetCode
    Can you solve this real interview question? Merge k Sorted Lists - You are given an array of k linked-lists lists, each linked-list is sorted in ascending order
  • Spiral Matrix - LeetCode
    Well for some problems, the best way really is to come up with some algorithms for simulation Basically, you need to simulate what the problem asks us to do
  • Array - LeetCode
    Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
  • Next Greater Element I - LeetCode
    Can you solve this real interview question? Next Greater Element I - The next greater element of some element x in an array is the first greater element that is to the right of x in the same array You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2 For each 0 <= i < nums1 length, find the index j such that nums1[i] == nums2[j] and determine
  • Set Matrix Zeroes - LeetCode
    If any cell of the matrix has a zero we can record its row and column number using additional memory But if you don't want to use extra memory then you can manipulate the array instead i e simulating exactly what the question says





中文字典-英文字典  2005-2009