<p><b>duda</b> 2010-03-26 12:15:04 -0600 (Fri, 26 Mar 2010)</p><p>Incorporate Mat Maltrud's changes to block decomposition module<br>
to avoid adding null/missing cell to list of ghost cells for<br>
a block.<br>
<br>
M    module_block_decomp.F<br>
</p><hr noshade><pre><font color="gray">Modified: branches/lateral_boundary_conditions/src/framework/module_block_decomp.F
===================================================================
--- branches/lateral_boundary_conditions/src/framework/module_block_decomp.F        2010-03-26 17:29:45 UTC (rev 164)
+++ branches/lateral_boundary_conditions/src/framework/module_block_decomp.F        2010-03-26 18:15:04 UTC (rev 165)
@@ -142,6 +142,7 @@
       edgeIDListLocal(:) = edgeIDList(:)
 
       do i=1,nEdges
+if (cellsOnEdge(1,i) == 0) write(0,*) 'block_decomp_partitioned_edge_list: cellsOnEdge(1,iEdge) is never expected to be 0'
          if (hash_search(h, cellsOnEdge(1,i))) then
             lastEdge = lastEdge + 1
             edgeIDList(lastEdge) = edgeIDListLocal(i)
@@ -231,8 +232,10 @@
 
       do i=1,local_graph_info % nVertices
          do j=1,local_graph_info % nAdjacent(i)
-            if (.not. hash_search(h, local_graph_info % adjacencyList(j,i))) then
-               call hash_insert(h, local_graph_info % adjacencyList(j,i))
+            if (local_graph_info % adjacencyList(j,i) /= 0) then
+               if (.not. hash_search(h, local_graph_info % adjacencyList(j,i))) then
+                  call hash_insert(h, local_graph_info % adjacencyList(j,i))
+               end if
             end if
          end do
       end do 
@@ -264,10 +267,12 @@
   write(0,*) 'block_decomp_add_halo: Somehow we don''t have the right number of non-ghost cells.'
       do i=1,local_graph_info % nVertices
          do j=1,local_graph_info % nAdjacent(i)
-            if (.not. hash_search(h, local_graph_info % adjacencyList(j,i))) then
-               call hash_insert(h, local_graph_info % adjacencyList(j,i))
-               local_graph_with_halo % vertexID(k) = local_graph_info % adjacencyList(j,i)
-               k = k + 1
+            if (local_graph_info % adjacencyList(j,i) /= 0) then
+               if (.not. hash_search(h, local_graph_info % adjacencyList(j,i))) then
+                  call hash_insert(h, local_graph_info % adjacencyList(j,i))
+                  local_graph_with_halo % vertexID(k) = local_graph_info % adjacencyList(j,i)
+                  k = k + 1
+               end if
             end if
          end do
       end do 

</font>
</pre>