Category

Development Platform
Home > SourceCode/Document > Mathimatics-Numerical algorithms > View Code
iteration.h
Package: leda.tar.gz　[view]
Upload User: gzelex
Upload Date: 2007-01-07
Package Size: 707k
Code Size: 3k
Category:

Mathimatics-Numerical algorithms

Development Platform:

MultiPlatform

iteration.h：Code Content
  1. /*******************************************************************************
  2. +
  3. +  LEDA-R  3.2.3
  4. +
  5. +  iteration.h
  6. +
  7. +  Copyright (c) 1995  by  Max-Planck-Institut fuer Informatik
  8. +  Im Stadtwald, 66123 Saarbruecken, Germany     
  9. +  All rights reserved.
  10. + 
  11. *******************************************************************************/
  13. #ifndef LEDA_ITERATION_H
  14. #define LEDA_ITERATION_H
  16. //------------------------------------------------------------------------------
  17. //   forall_items(it,...)
  18. //------------------------------------------------------------------------------
  20. #define forall_items(x,S)
  21. for(x = (S).first_item(); x; x = (S).next_item(x) )
  24. //------------------------------------------------------------------------------
  25. //   forall(x,...)
  26. //   Forall(x,...)
  27. //   forall_defined(x,...)
  28. //------------------------------------------------------------------------------
  30. // As long as the new scoping rules are not supported we avoid multiple 
  31. // declarations of the forall-loop variable by placing it in the else 
  32. // part of a dummy if-statement. However, even this does not work with some 
  33. // compilers (ztc, HP C++).
  34.   
  35. #if defined(__NEW_SCOPE_RULES__)
  37. #define forall(x,S)
  38. for(GenPtr forall_loop_item = (S).first_item();
  39. (S).forall_loop_test(forall_loop_item,x);
  40. (S).loop_to_succ(forall_loop_item))
  42. #define Forall(x,S)
  43. for(GenPtr forall_loop_item = (S).last_item();
  44. (S).forall_loop_test(forall_loop_item,x);
  45. (S).loop_to_pred(forall_loop_item))
  47. #define forall_defined(x,S)
  48. for (GenPtr forall_loop_item = (S).first_item();
  49. (S).forall_defined_test(forall_loop_item,x);
  50. (S).loop_to_succ(forall_loop_item))
  52. #else
  54. #if !defined(__ELSE_SCOPE_BUG__)
  56. #define forall(x,S)
  57. if (0); else 
  58. for(GenPtr forall_loop_item = (S).first_item();
  59. (S).forall_loop_test(forall_loop_item,x);
  60. (S).loop_to_succ(forall_loop_item))
  62. #define Forall(x,S)
  63. if (0); else 
  64. for(GenPtr forall_loop_item = (S).last_item();
  65. (S).forall_loop_test(forall_loop_item,x);
  66. (S).loop_to_pred(forall_loop_item))
  68. #define forall_defined(x,S)
  69. if (0); else 
  70. for (GenPtr forall_loop_item = (S).first_item();
  71. (S).forall_defined_test(forall_loop_item,x);
  72. (S).loop_to_succ(forall_loop_item))
  74. #else
  76. #define forall(x,S)
  77. for((S).Forall_Loop_Item()=(S).first_item();
  78. (S).forall_loop_test((S).Forall_Loop_Item(),x);
  79. (S).loop_to_succ((S).Forall_Loop_Item()))
  81. #define Forall(x,S)
  82. for((S).Forall_Loop_Item()=(S).last_item();
  83. (S).forall_loop_test((S).Forall_Loop_Item(),x);
  84. (S).loop_to_pred((S).Forall_Loop_Item()))
  86. #define forall_defined(x,S)
  87. for((S).Forall_Loop_Item()=(S).first_item();
  88. (S).forall_defined_test((S).Forall_Loop_Item(),x);
  89. (S).loop_to_succ((S).Forall_Loop_Item()))
  91. #endif
  93. #endif
  96. #endif