| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2005 Maksim Orlovich <maksim@kde.org> | 2 * Copyright 2005 Maksim Orlovich <maksim@kde.org> |
| 3 * Copyright (C) 2006 Apple Computer, Inc. | 3 * Copyright (C) 2006 Apple Computer, Inc. |
| 4 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 4 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
| 5 * | 5 * |
| 6 * Redistribution and use in source and binary forms, with or without | 6 * Redistribution and use in source and binary forms, with or without |
| 7 * modification, are permitted provided that the following conditions | 7 * modification, are permitted provided that the following conditions |
| 8 * are met: | 8 * are met: |
| 9 * | 9 * |
| 10 * 1. Redistributions of source code must retain the above copyright | 10 * 1. Redistributions of source code must retain the above copyright |
| (...skipping 524 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 535 #if !ENABLE(OILPAN) | 535 #if !ENABLE(OILPAN) |
| 536 if (node == 0) | 536 if (node == 0) |
| 537 return; | 537 return; |
| 538 | 538 |
| 539 ASSERT(m_parseNodes.contains(node)); | 539 ASSERT(m_parseNodes.contains(node)); |
| 540 | 540 |
| 541 m_parseNodes.remove(node); | 541 m_parseNodes.remove(node); |
| 542 #endif | 542 #endif |
| 543 } | 543 } |
| 544 | 544 |
| 545 void Parser::registerPredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predica
te> >* vector) | 545 void Parser::registerPredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predica
te>>* vector) |
| 546 { | 546 { |
| 547 #if !ENABLE(OILPAN) | 547 #if !ENABLE(OILPAN) |
| 548 if (vector == 0) | 548 if (vector == 0) |
| 549 return; | 549 return; |
| 550 | 550 |
| 551 ASSERT(!m_predicateVectors.contains(vector)); | 551 ASSERT(!m_predicateVectors.contains(vector)); |
| 552 | 552 |
| 553 m_predicateVectors.add(vector); | 553 m_predicateVectors.add(vector); |
| 554 #endif | 554 #endif |
| 555 } | 555 } |
| 556 | 556 |
| 557 void Parser::deletePredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate
> >* vector) | 557 void Parser::deletePredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate
>>* vector) |
| 558 { | 558 { |
| 559 #if !ENABLE(OILPAN) | 559 #if !ENABLE(OILPAN) |
| 560 if (vector == 0) | 560 if (vector == 0) |
| 561 return; | 561 return; |
| 562 | 562 |
| 563 ASSERT(m_predicateVectors.contains(vector)); | 563 ASSERT(m_predicateVectors.contains(vector)); |
| 564 | 564 |
| 565 m_predicateVectors.remove(vector); | 565 m_predicateVectors.remove(vector); |
| 566 delete vector; | 566 delete vector; |
| 567 #endif | 567 #endif |
| 568 } | 568 } |
| 569 | 569 |
| 570 | 570 |
| 571 void Parser::registerExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expres
sion> >* vector) | 571 void Parser::registerExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expres
sion>>* vector) |
| 572 { | 572 { |
| 573 #if !ENABLE(OILPAN) | 573 #if !ENABLE(OILPAN) |
| 574 if (vector == 0) | 574 if (vector == 0) |
| 575 return; | 575 return; |
| 576 | 576 |
| 577 ASSERT(!m_expressionVectors.contains(vector)); | 577 ASSERT(!m_expressionVectors.contains(vector)); |
| 578 | 578 |
| 579 m_expressionVectors.add(vector); | 579 m_expressionVectors.add(vector); |
| 580 #endif | 580 #endif |
| 581 } | 581 } |
| 582 | 582 |
| 583 void Parser::deleteExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expressi
on> >* vector) | 583 void Parser::deleteExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expressi
on>>* vector) |
| 584 { | 584 { |
| 585 #if !ENABLE(OILPAN) | 585 #if !ENABLE(OILPAN) |
| 586 if (vector == 0) | 586 if (vector == 0) |
| 587 return; | 587 return; |
| 588 | 588 |
| 589 ASSERT(m_expressionVectors.contains(vector)); | 589 ASSERT(m_expressionVectors.contains(vector)); |
| 590 | 590 |
| 591 m_expressionVectors.remove(vector); | 591 m_expressionVectors.remove(vector); |
| 592 delete vector; | 592 delete vector; |
| 593 #endif | 593 #endif |
| (...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 630 #if !ENABLE(OILPAN) | 630 #if !ENABLE(OILPAN) |
| 631 if (t == 0) | 631 if (t == 0) |
| 632 return; | 632 return; |
| 633 | 633 |
| 634 ASSERT(m_nodeTests.contains(t)); | 634 ASSERT(m_nodeTests.contains(t)); |
| 635 | 635 |
| 636 m_nodeTests.remove(t); | 636 m_nodeTests.remove(t); |
| 637 #endif | 637 #endif |
| 638 } | 638 } |
| 639 | 639 |
| OLD | NEW |