зеркало из https://github.com/mozilla/gecko-dev.git
Fix some spelling errors in comments. Bug 106386, patch by Nicholas Bebout
<nb@ipnode.info>, r=doron, sr=dmose
This commit is contained in:
bzbarsky%mit.edu
Родитель
d776b1c008
Коммит
83e46b1a49
|
|
@ -161,7 +161,7 @@ void nsLDAPServiceEntry::SetMessage(nsILDAPMessage *aMessage)
|
|||
// Push/Pop pending listeners/callback for this server entry. This is
|
||||
// implemented as a "stack" on top of the nsVoidArrays, since we can
|
||||
// potentially have more than one listener waiting for the connection
|
||||
// to be avilable for consumption.
|
||||
// to be available for consumption.
|
||||
//
|
||||
already_AddRefed<nsILDAPMessageListener> nsLDAPServiceEntry::PopListener()
|
||||
{
|
||||
|
|
|
|||
|
|
@ -332,7 +332,7 @@ public:
|
|||
virtual PyObject *UnwrapPythonObject(void) = 0;
|
||||
};
|
||||
|
||||
// This is roughly equivilent to PyGatewayBase in win32com
|
||||
// This is roughly equivalent to PyGatewayBase in win32com
|
||||
//
|
||||
class PYXPCOM_EXPORT PyG_Base : public nsIInternalPython, public nsISupportsWeakReference
|
||||
{
|
||||
|
|
|
|||
|
|
@ -1086,7 +1086,7 @@ GlobalPrinters::GetDefaultPrinterName(LPTSTR& aDefaultPrinterName)
|
|||
}
|
||||
|
||||
//----------------------------------------------------------------------------------
|
||||
// This goes and gets the list of of avilable printers and puts
|
||||
// This goes and gets the list of available printers and puts
|
||||
// the default printer at the beginning of the list
|
||||
nsresult
|
||||
GlobalPrinters::EnumeratePrinterList()
|
||||
|
|
|
|||
|
|
@ -272,7 +272,7 @@ interface jsdIDebuggerService : nsISupports
|
|||
/**
|
||||
* Enumerate registered filters. This routine refreshes each filter before
|
||||
* passing them on to the enumeration function. Calling this with a null
|
||||
* |enumerator| is equivilant to jsdIService::refreshFilters.
|
||||
* |enumerator| is equivalent to jsdIService::refreshFilters.
|
||||
*
|
||||
* @param enumerator jsdIFilterEnumerator instance to be called back for the
|
||||
* enumeration.
|
||||
|
|
@ -281,7 +281,7 @@ interface jsdIDebuggerService : nsISupports
|
|||
/**
|
||||
* Force the debugger to resync its internal filter cache with the
|
||||
* actual values in the jsdIFilter objects. To refresh a single filter
|
||||
* use jsdIService::swapFilters. This method is equivilant to
|
||||
* use jsdIService::swapFilters. This method is equivalent to
|
||||
* jsdIService::enumerateFilters with a null enumerator.
|
||||
*/
|
||||
void refreshFilters ();
|
||||
|
|
|
|||
|
|
@ -374,7 +374,7 @@ typedef unsigned long JSUptrdiff;
|
|||
** Use JSBool for variables and parameter types. Use JS_FALSE and JS_TRUE
|
||||
** for clarity of target type in assignments and actual arguments. Use
|
||||
** 'if (bool)', 'while (!bool)', '(bool) ? x : y' etc., to test booleans
|
||||
** juast as you would C int-valued conditions.
|
||||
** just as you would C int-valued conditions.
|
||||
************************************************************************/
|
||||
typedef JSIntn JSBool;
|
||||
#define JS_TRUE (JSIntn)1
|
||||
|
|
|
|||
|
|
@ -2718,7 +2718,7 @@ static JSBool MembersAreTheSame(XPCNativeInterface* iface1,
|
|||
PRUint16 index1 = member1->GetIndex();
|
||||
PRUint16 index2 = member2->GetIndex();
|
||||
|
||||
// If they are both constants, then we'll just be sure that are equivelent.
|
||||
// If they are both constants, then we'll just be sure that they are equivalent.
|
||||
|
||||
if(member1->IsConstant())
|
||||
{
|
||||
|
|
|
|||
|
|
@ -1702,8 +1702,8 @@ nsComboboxControlFrame::Reflow(nsIPresContext* aPresContext,
|
|||
#endif
|
||||
|
||||
// cache the availabe size to be our desired size minus the borders
|
||||
// this is so if our cached avilable size is ever equal to or less
|
||||
// than the real avilable size we can bail out
|
||||
// this is so if our cached available size is ever equal to or less
|
||||
// than the real available size we can bail out
|
||||
if (aReflowState.availableWidth != NS_UNCONSTRAINEDSIZE) {
|
||||
mCachedAvailableSize.width = aDesiredSize.width -
|
||||
(aReflowState.mComputedBorderPadding.left +
|
||||
|
|
|
|||
|
|
@ -524,7 +524,7 @@ nsPageFrame::DrawHeaderFooter(nsIPresContext* aPresContext,
|
|||
if (len == 0) {
|
||||
return; // bail is empty string
|
||||
}
|
||||
// find how much text fits, the "position" is the size of the avilable area
|
||||
// find how much text fits, the "position" is the size of the available area
|
||||
if (BinarySearchForPosition(&aRenderingContext, text, 0, 0, 0, len,
|
||||
PRInt32(contentWidth), indx, textWidth)) {
|
||||
if (indx < len-1 && len > 3) {
|
||||
|
|
|
|||
|
|
@ -524,7 +524,7 @@ nsPageFrame::DrawHeaderFooter(nsIPresContext* aPresContext,
|
|||
if (len == 0) {
|
||||
return; // bail is empty string
|
||||
}
|
||||
// find how much text fits, the "position" is the size of the avilable area
|
||||
// find how much text fits, the "position" is the size of the available area
|
||||
if (BinarySearchForPosition(&aRenderingContext, text, 0, 0, 0, len,
|
||||
PRInt32(contentWidth), indx, textWidth)) {
|
||||
if (indx < len-1 && len > 3) {
|
||||
|
|
|
|||
|
|
@ -1702,8 +1702,8 @@ nsComboboxControlFrame::Reflow(nsIPresContext* aPresContext,
|
|||
#endif
|
||||
|
||||
// cache the availabe size to be our desired size minus the borders
|
||||
// this is so if our cached avilable size is ever equal to or less
|
||||
// than the real avilable size we can bail out
|
||||
// this is so if our cached available size is ever equal to or less
|
||||
// than the real available size we can bail out
|
||||
if (aReflowState.availableWidth != NS_UNCONSTRAINEDSIZE) {
|
||||
mCachedAvailableSize.width = aDesiredSize.width -
|
||||
(aReflowState.mComputedBorderPadding.left +
|
||||
|
|
|
|||
|
|
@ -930,7 +930,7 @@ nsTableOuterFrame::BalanceLeftRightCaption(nsIPresContext* aPresContext,
|
|||
* aCaptionWidth = capPercent/(1-capPercent) *
|
||||
* (aCaptionMargin.left + aCaptionMargin.right + aInnerwidth + aInnerMargin.right)
|
||||
* this result will cause problems for capPercent >= 1, in these cases the algorithm will now bail out
|
||||
* a similiar expression can be found for the right case
|
||||
* a similar expression can be found for the right case
|
||||
* d) both frames have percent widths in this case the caption width will be the inner width multiplied
|
||||
* by the weight capPercent/innerPercent
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@
|
|||
</TABLE>
|
||||
</FORM>
|
||||
|
||||
<P>Last three columns show equivilent SIZE number on Windows 98 SE. (ie SIZE="" results in a field
|
||||
<P>Last three columns show equivalent SIZE number on Windows 98 SE. (ie SIZE="" results in a field
|
||||
as wide as a SIZE=20 in IE and as wide as a SIZE=1 field in NS. It does not reflect how many characters
|
||||
that actually fits.)
|
||||
<P>Notice how Mozilla (2000-07-20) treats "NaN" differently from other invalid values like "XYZ" for example.
|
||||
|
|
|
|||
|
|
@ -930,7 +930,7 @@ nsTableOuterFrame::BalanceLeftRightCaption(nsIPresContext* aPresContext,
|
|||
* aCaptionWidth = capPercent/(1-capPercent) *
|
||||
* (aCaptionMargin.left + aCaptionMargin.right + aInnerwidth + aInnerMargin.right)
|
||||
* this result will cause problems for capPercent >= 1, in these cases the algorithm will now bail out
|
||||
* a similiar expression can be found for the right case
|
||||
* a similar expression can be found for the right case
|
||||
* d) both frames have percent widths in this case the caption width will be the inner width multiplied
|
||||
* by the weight capPercent/innerPercent
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -180,7 +180,7 @@ static dns_lookup *dns_lookup_queue = 0;
|
|||
// Name: getNextDnsEntry
|
||||
//
|
||||
// Description: Return the idx entry to the caller. Bump the index up
|
||||
// by 1 before the return. Similiar to an iterator.
|
||||
// by 1 before the return. Similar to an iterator.
|
||||
//
|
||||
static dns_lookup*
|
||||
getNextDnsEntry (int *idx)
|
||||
|
|
|
|||
|
|
@ -126,7 +126,7 @@ interface nsIMIMEInfo : nsISupports {
|
|||
|
||||
/**
|
||||
* Returns whether or not these two MIME infos are logically
|
||||
* equivelent maintaining the one-to-many relationship between
|
||||
* equivalent maintaining the one-to-many relationship between
|
||||
* MIME types and file extensions.
|
||||
*
|
||||
* @returns TRUE if the two are considered equal
|
||||
|
|
|
|||
|
|
@ -1548,7 +1548,7 @@ Wed Nov 4 15:06:44 PST 1998 Manish Singh <yosh@gimp.org>
|
|||
(g_array_remove_index_fast): new function for removing an entry
|
||||
from an array. the order might be distorted
|
||||
(g_ptr_array_remove_index_fast, g_ptr_array_remove_fast): new
|
||||
functions; working similiar to the above. (they have the semantic
|
||||
functions; working similar to the above. (they have the semantic
|
||||
of the old g_ptr_array_remove[_index] functions)
|
||||
(g_ptr_array_remove_index, g_ptr_array_remove): new semantic. now
|
||||
the order of the elements in the array is not changed
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче