Section connect delete_section nseg section_owner create disconnect section_exists topology
Topology
create
prints the names of all the sections which have been created.create soma, axon, dend[3] forall { print secname() }
soma axon dend[0] dend[1] dend[2]
Topology
connect section(0or1), x
connect section(0or1), parent(x)
create soma, axon, dendrite[3] connect axon(0), soma(0) soma for i=0,2 { connect dendrite[i](0), 1 } topology() objref s s = new Shape()
Topology
topology()
Topology
delete_section()
forall delete_section
will remove all sections.
Note: deleted sections still exist (even though SectionRef . exists returns 0 and an error will result if one attempts to access the section) so that other objects (such as section lists and Shapes) which hold pointers to these sections will still work. When the last pointer to a section is destroyed, the section memory will be freed.
Topology
boolean = section_exists("name", [index], [object])
Topology
section_owner()
Topology
disconnect()
Topology
Starting in version 3.2, a change to nseg re-uses information contained in the old segments.
If nseg is increased, all old segments are relocated to their nearest new locations (no instance variables are modified and no pointers to data in those segments become invalid). and new segments are allocated and given mechanisms and values that are identical to the old segment in which the center of the new segment is located. This means that increasing nseg by an odd factor preserves the locations of all previous data (including all Point Processes) and, if PARAMETER range variables are constant, that all the new segments have the proper PARAMETER values. (It generally doesn't matter that ASSIGNED and STATE values do not get interpolated since those values are computed with fadvance()). If range variables are not constant then the hoc expressions used to set them should be re-executed.
If nseg is decreased then all the new segments are in fact those old segments that were nearest the centers of the new segments. Unused old segments are freed (and thus any existing pointers to variables in those freed segments are invalid). This means that decreasing nseg by an odd factor preserves the locations of all previous data. However POINT PROCESSES not located at the centers of the new segments will be discarded.
The intention is to guarantee that the following sequence
will produce identical simulations for sim1 and sim3. And sim2 will be oddfactor^2 more accurate with regard to spatial discretization error.run() //sim1 forall nseg *= oddfactor run() //sim2 forall nseg /= oddfactor run() //sim3