mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 04:12:43 +00:00 
			
		
		
		
	LibDraw: Introduce (formerly known as SharedGraphics.)
Instead of LibGUI and WindowServer building their own copies of the drawing and graphics code, let's it in a separate LibDraw library. This avoids building the code twice, and will encourage better separation of concerns. :^)
This commit is contained in:
		
							parent
							
								
									2167f60235
								
							
						
					
					
						commit
						1c0669f010
					
				
					 120 changed files with 201 additions and 190 deletions
				
			
		|  | @ -1,45 +0,0 @@ | |||
| #include <SharedGraphics/DisjointRectSet.h> | ||||
| 
 | ||||
| void DisjointRectSet::add(const Rect& new_rect) | ||||
| { | ||||
|     for (auto& rect : m_rects) { | ||||
|         if (rect.contains(new_rect)) | ||||
|             return; | ||||
|     } | ||||
| 
 | ||||
|     m_rects.append(new_rect); | ||||
|     if (m_rects.size() > 1) | ||||
|         shatter(); | ||||
| } | ||||
| 
 | ||||
| void DisjointRectSet::shatter() | ||||
| { | ||||
|     Vector<Rect, 32> output; | ||||
|     output.ensure_capacity(m_rects.size()); | ||||
|     bool pass_had_intersections = false; | ||||
|     do { | ||||
|         pass_had_intersections = false; | ||||
|         output.clear_with_capacity(); | ||||
|         for (int i = 0; i < m_rects.size(); ++i) { | ||||
|             auto& r1 = m_rects[i]; | ||||
|             for (int j = 0; j < m_rects.size(); ++j) { | ||||
|                 if (i == j) | ||||
|                     continue; | ||||
|                 auto& r2 = m_rects[j]; | ||||
|                 if (!r1.intersects(r2)) | ||||
|                     continue; | ||||
|                 pass_had_intersections = true; | ||||
|                 auto pieces = r1.shatter(r2); | ||||
|                 for (auto& piece : pieces) | ||||
|                     output.append(piece); | ||||
|                 m_rects.remove(i); | ||||
|                 for (; i < m_rects.size(); ++i) | ||||
|                     output.append(m_rects[i]); | ||||
|                 goto next_pass; | ||||
|             } | ||||
|             output.append(r1); | ||||
|         } | ||||
|     next_pass: | ||||
|         swap(output, m_rects); | ||||
|     } while (pass_had_intersections); | ||||
| } | ||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue
	
	 Andreas Kling
						Andreas Kling