Routines by Category ĭRAWCIRCLE DRAWELLIPSE FINDRATZ FOLLOWCONTOUR OPLOTDASH PLOT3_MPTS PLOTDASH SHADE_SURFRANGE SHOW3M SURFRANGE TH_IMAGE_CONT TVIMAGE_CONGRID VECTORSURFĪLPHAMOVIE10 ANIM2CINE ANIMXYPLOT CINE2MPEG CINEAVE DISPLAYFCTIFFS FCDCMOVIES FCTIFFSVCR FCVCR MK_MPEG MPEG_FROM_SCREEN MPTSCAM WRITE_MPEG XANIMJPEG XEASYANIM XIA XYANIMīITS BTEST DECODE_GRAY MK_BITARRAY SHOWBITSīLOBBINRANGES BLOBTRAILS GENNETCDFBLOBS GPICONT GPIMOUNTAIN LOADBLOBS PLOTBLOBVYVSBIN POPULATEBLOBS SAVEBLOBSīETTERRAINBOW COLORSEARCH DECOMPOSEDCOLOR MK_COLOR STRETCHSTEPS WHITEOUTĬREATE_LOCUS_TABLE DB_COLUMNS DB_LIST LOGBOOK_LIST_PLUS LOGBOOK_LIST LOGBOOK_OPTIONS (COPIED FROM LOGBOOK_OPTIONS) SYB_ENTRYĪDDDATE DATE2JD DATE2YMD FILESHOTDATE FILETIME2DBTIME FROMIDLSECONDS FROMIDLTIME GETFILETIME HOURS2TIME ISOTIME JD2DATE JD2YMD LONG64DATE2STR LONGDATE2STR MDSSHOTDATE MDSTIME2DBTIME MDSTIME2VSTIME MONTHNAMES MONTHNUMBER SHOTATTIME SHOTSOFFILES TIME2SEC TIMESOFSHOTS TOIDLTIME WEEKDAY YMD2DATE YMD2JD YRMONTHDAYĬALCBTBP EFITMOVIES EFIT_TIMES GETEFIT GETSEP HIGHESTEFITRUN INTERPEDGE PECOMP PLASMAEDGE PSIINTERP SEPVSTIMEĬAGETCOUNTANDTYPE CAGET CAGETTIMEOUT CASETTIMEOUT CAGETRETRYCOUNT CASETRETRYCOUNT CAPUT CASTARTGROUP CAENDGROUP CASETMONITOR CACLEARMONITOR CACHECKMONITOR CADEBUG CATRACE CAGETENUMSTRINGS CAGETCONTROLLIMITS CAGETGRAPHICLIMITS CAGETPRECISION CAGETSTATUS CAGETUNITS CAERROR CAVERSION CAINIT CAPENDEVENT CAPENDIO CATIMESTAMP CASEARCH CAGETERROR CAGETARRAY CAPUTARRAY CASCAN CAMONITORĮXECONEVENT MONEVENTS_NOXMANAGER MONEVENTS WATCHEVENTSįDECOMP FILE2STRUCT FINDCAMFILES GETNEXTFILE H5DFROMTEXT MKDATEDIR MK_FILENAME MVSHOTRANGEDIR NUMLINES READ_ARRAY READCOL READ_FLOATS READ_GENERIC READ_LIST READNETCDFBLOBS READ_NUMBERS READ_QUOTED READ_TABLE RMFILESBYDATE SPEC_DIR WRITE_GENERIC WRITE_TEXT NOTE: Non-PPPL employees may access these routines by following procedure GEN-034. This page was created by a MODIFICATION of the IDL library routine 6.Local IDL Routines By Category Local IDL Routines 5.9.1 The Idea of Efficient Exponentiation. 5.8.2 Mathematical Insights to Speed-up the Solution. 5.7.1 Solution using Efficient Data Structure. 5.5.8 Extended Euclid: Solving Linear Diophantine Equation. 5.5.4 Finding Prime Factors with Optimized Trial Divisions. 5.5.2 Greatest Common Divisor (GCD) & Least Common Multiple 5.5.3 Factorial. 5.2 Ad Hoc Mathematics Problems 5.3 Java BigInteger Class. ĥ Mathematics 5.1 Overview and Motivation. 4.5.2 Explanation of Floyd Warshall’s DP Solution. 4.4.4 SSSP on Graph with Negative Weight Cycle. 4.2.8 Finding Articulation Points and Bridges (in an Undirected Graph) 4.2.9 Finding Strongly Connected Components (in a Directed Graph). 4.2.7 Graph Edges Property Check via DFS Spanning Tree. 4.2.5 Topological Sort (of a Directed Acyclic Graph). 4.2.4 Flood Fill - Labeling/Coloring the Connected Components. 4.2.3 Finding Connected Components (in an Undirected Graph). ģ Problem Solving Paradigms 3.1 Overview and Motivation 3.2 Complete Search. 2.3 Data Structures with Our-Own Libraries 2.3.1 Graph. 2.2 Data Structures with Built-in Libraries. Ģ Data Structures and Libraries 2.1 Overview and Motivation. 1.3 Getting Started: The Ad Hoc Problems. 1.2.3 Tip 4: Master Programming Languages 1.2.4 Tip 5: Master the Art of Testing Code. 1.2.1 Tip 2: Quickly Identify Problem Types 1.2.2 Tip 3: Do Algorithm Analysis. 1 Introduction 1.1 Competitive Programming.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |