1 / 3

Efficient Data Retrieval from Crystallographic Reflection Lists in PLATON Software

This guide discusses three methods for locating data associated with a given reflection (hkl) in a linear reflection dataset using PLATON, a multipurpose crystallographic tool developed by A.L. Spek at Utrecht University. The first option involves a linear search, which is memory efficient but time inefficient. The second option utilizes a 3-dimensional address array, optimizing access but requiring careful worst-case dimensioning. The third option employs a linear address array, simplifying access without the need for worst-case considerations.

idona-martinez
Télécharger la présentation

Efficient Data Retrieval from Crystallographic Reflection Lists in PLATON Software

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Programming the Science ofCrystallography PLATON, a Multipurpose Crystallographic Tool A.L.Spek, Utrecht University

  2. How to find the data belonging to a given reflection hkl in a linear list of reflection data Reflection data assumed in array REFL(I,J) • Option #1: linear search Memory efficient but time inefficient • Option #2: with the help of a 3-dimensional address array Addresses array requires worst case dimensioning Array element ADDR(H,K,L) contains the address I for the data in REFL(I,J) • Option #3: with the help of a linear address array No worst case dimensioning needed

More Related